For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These … lexicographic rules is shown to satisfy many desirable properties (core selection, symmetry, demand additivity,...). Our method …

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These …

allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost … consideration to all its members, it is shown that a cost-revenue game has a nonempty core for any vector of revenues if, and only … if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games …

of the core of a game on a convex geometry. First, we show that if a game is quasi-convex, then the core is stable. This … result can be seen as an extension of a result by Shapley for traditional cooperative games. Secondly, we show the core on …, we axiomatize the core by means of consistency, as is analogous to a result by Peleg for traditional cooperative games …