The Reverse Talmud rule for bankruptcy problems applies the Constrained Equal Awards rule (CEA rule) for ‘large’ amounts of the estate, while it applies the Constrained Equal Losses rule (CEL rule) for ‘small’ amounts of the estate. The CEA rule, respectively CEL rule, can be axiomatized...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utilities -or simply a TU-game. A value mapping for TU-games is a mapping that assigns to every game a set of vectors each representing a distribution...

A cooperative game with transferable utilities--or simply a TU-game--describes a situation in which players can obtain certain payoffs by cooperation. A solution concept for these games is a function which assigns to every such a game a distribution of payoffs over the players in the game....