Strictly strong $(n-1)$-equilibrium in $n$-person multicriteria games

Using some specific approach to the coalition-consistency analysis in $n$-person multicriteria games we introduce two refinements of (weak Pareto) equilibria: the strong and strictly strong $(n-1)$-equilibriums. Axiomatization of the strictly strong $(n-1)$-equilibria (on closed families of multicriteria games) is provided in terms of consistency, strong one-person rationality, suitable variants of Pareto optimality and converse consistency axiom and others.