We show that the lexicographic maximin solution is the only solution that satisfies the axioms of Pareto optimality, comprehensive hull axiom and duplicated individual monotonicity. Copyright Springer-Verlag Berlin Heidelberg 1999

We show that the lexicographic maximin solution is the only solution that satisfies the axioms of Pareto optimality, comprehensive hull axiom and duplicated individual monotonicity. Copyright Springer-Verlag Berlin Heidelberg 1999

We will find 3 maximal subclasses with respect to essential, superadditive and convex games, respectively such that a game is in one subclass, so are its reduced games.