Egalitarianism in Multi-Choice Games

Abstract

In this paper we introduce the equal division core for arbitrary multi-choice games and the constrained egalitarian solution for con- vex multi-choice games, using a multi-choice version of the Dutta-Ray algorithm for traditional convex games. These egalitarian solutions for multi-choice games have similar properties as their counterparts for traditional cooperative games. On the class of convex multi-choice games, we axiomatically characterize the constrained egalitarian solution.

Keywords: Multi-choice games, Convex games, Equal division core, Constrained egalitarian solution

JEL Classification: C71