Implementing egalitarianism in a class of Nash demand games

We add a stage to Nash’s demand game by allowing the greedier player to revise his demand if the demands are not jointly feasible. If he decides to stick to his initial demand, then the game ends and no one receives anything. If he decides to revise it down to 1 - x, where x is his initial demand, the revised demand is implemented with certainty. The implementation probability changes linearly between these two extreme cases. We derive a condition on the feasible set under which the two-stage game has a unique subgame perfect equilibrium. In this equilibrium, there is first-stage agreement on the egalitarian demands. We also study two n-player versions of the game. In either version, if the underlying bargaining problem is “divide-the-dollar,” then equal division is sustainable in a subgame perfect equilibrium if and only if the number of players is at most four.