Nash equilibria for strategic games were characterized by Peleg and Tijs (1996) as those solutions satisfying the properties of consistency, converse consistency and one-person rationality. <p> There are other solutions, like the -Nash equilibria, which enjoy nice properties and appear to be...</p>

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...