The present paper examines zero-sum games that are based on a cyclic preference relation defined over anonymous 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 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...