We provide new characterizations of the egalitarian bargaining solution on the class of strictly comprehensive n‐person bargaining problems. The main axioms used in all of our results are Nash’s IIA and disagreement point monotonicity–an axiom which requires a player’s payoff to strictly increase in his disagreement payoff. For n = 2 these axioms, together with other standard requirements, uniquely characterize the egalitarian solution. For n > 2 we provide two extensions of our 2‐person result, each of which is obtained by imposing an additional axiom on the solution. Dropping the axiom of anonymity, strengthening disagreement point monotonicity by requiring player i’s payoff to be a strictly decreasing function of the disagreement payoff of every other player j
i, and adding a ‘weak convexity’ axiom regarding changes of the disagreement point, we obtain a characterization of the class of weighted egalitarian solutions. This ‘weak convexity’ axiom requires that a movement of the disagreement point in the direction of the solution point should not change the solution point. We also discuss the so‐called ‘transfer paradox’ and relate it to this axiom.
