Monotonicity and Egalitarianism (revision of CentER DP 2019-007)

This paper identifies the maximal domain of transferable utility games on which aggregate monotonicity (no player is worse o when the worth of the grand coalition increases) and egalitarian core selection (no other core allocation can be obtained by a transfer from a richer to a poorer player) are compatible. On this domain, which includes the class of large core games, we show that these two axioms characterize a unique solution which even satisfies coalitional monotonicity (no member is worse off when the worth of one coalition increases) and strong egalitarian core selection (no other core allocation can be obtained by transfers from richer to poorer players)

Consistency of the Equal Split-Off Set

This paper axiomatically studies the equal split-off set (cf. Branzei et al. (2006)) as a solution for cooperative games with transferable utility. This solution extends the well-known Dutta and Ray (1989) solution for convex games to arbitrary games. By deriving several characterizations, we explore the relation of the equal split-off set with various consistency notions

Fair and consistent prize allocation in competitions

Given the final ranking of a competition, how should the total prize endowment be allocated among the competitors? We study consistent prize allocation rules satisfying elementary solidarity and fairness principles. In particular, we axiomatically characterize two families of rules satisfying anonymity, order preservation, and endowment monotonicity, which all fall between the Equal Division rule and the Winner-Takes-All rule. Specific characterizations of rules and subfamilies are directly obtained.Comment: 34 page

Egalitarianism in Nontransferable Utility Games

This paper studies egalitarianism in the context of nontransferable utility games by introducing and analyzing the egalitarian value. This new solution concept is based on an egalitarian negotiation procedure in which egalitarian opportunities of coalitions are explicitly taken into account. We formulate conditions under which it leads to a core element and discuss the egalitarian value for the well-known Roth-Shafer examples. Moreover, we characterize the new value on the class of bankruptcy games and bargaining games

Mechanisms for division problems with single-dipped preferences

A mechanism allocates one unit of an infinitely divisible commodity among agents reporting a number between zero and one. Nash, Pareto optimal Nash, and strong equilibria are analyzed for the case where the agents have single-dipped preferences. One of the main results is that when the mechanism is anonymous, monotonic, standard, and order preserving, then the Pareto optimal Nash and strong equilibria coincide and assign Pareto optimal allocations that are characterized by so-called maximal coalitions: members of a maximal coalition prefer an equal coalition share over obtaining zero, whereas the outside agents prefer zero over obtaining an equal share from joining the coalition