For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate shares according to some lexicographic preference relation. A computational procedure is provided. Our results relate to those of Tijs et al. (2011).

The present work characterizes the unique Nash equilibrium for games that are based on a cyclic preference relation. In the Nash equilibrium of these games, each player randomizes between three specific actions. In particular, an alternative way of deriving the unique Nash equilibrium of the...

This paper examines zero-sum games that are based on a cyclic preference relation defined over undistinguished actions. For each of these games, the set of Nash equilibria is characterized. When the number of actions is odd, a unique Nash equilibrium is always obtained. On the other hand, in the...