The Procedural Egalitarian Solution and Egalitarian Stable Games

Abstract

This paper studies the procedural egalitarian solution on the class of egalitarian stable games. By deriving several axiomatic characterizations involving consistency and monotonicity, we show that the procedural egalitarian solution satisfies various desirable properties and unites many egalitarian concepts defined in the literature. Moreover, we illustrate the computational implications of these characterizations and relate the class of egalitarian stable games to other well-known classes.