Kalai and Zemel introduced a class of flow-games showing that these games have a non-empty core and that a minimum cut corresponds to a core allocation.  We consider flow-games with a finite number of players on a network with infinitely many arcs: assuming that the total sum of the capacities...

A class of cooperative games arising from economic and operations research situations in which agents with potential individual possibilities are connected via a hierarchy within an organization is introduced. It is shown that the games in this class form a cone which lies in the intersection of...

A class of cooperative games arising from economic and operations research situations in which agents with potential individual possibilities are connected via a hierarchy within an organization is introduced. It is shown that the games in this class form a cone which lies in the intersection of...

Kalai and Zemel introduced a class of flow-games showing that these games have a non-empty core and that a minimum cut corresponds to a core allocation.  We consider flow-games with a finite number of players on a network with infinitely many arcs: assuming that the total sum of the capacities...

In this note we represent a classical bankruptcy problem as a standard flow problem on a simple network and implement some known division rules from the bankruptcy literature via suitable cost functions in the related minimum cost flow problem.