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

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

In this paper we discuss the level set method of Joó and how to use it to give an elementary proof of the well-known Sion’s minimax result. Although this proof technique is initiated by Joó and based on the inter-section of upper level sets and a clever use of the topological notion...

Von Neumann proved the minimax theorem (existence of a saddle-point solution to 2 person, zero sum games) in 1928. While his second article on the minimax theorem, stating the proof, has long been translated from German, his first announcement of his result (communicated in French to the Academy...

In 1951, Dantzig showed the equivalence of linear programming problems and two-person zero-sum games. However, in the description of his reduction from linear programs to zero-sum games, he noted that there was one case in which the reduction does not work. This also led to incomplete proofs of...

In this paper, by virtue of the separation theorem of convex sets, we prove a minimax theorem, a cone saddle point theorem and a Ky Fan minimax theorem for a scalar set-valued mapping under nonconvex assumptions of its domains, respectively. As applications, we obtain an existence result for the...

In this paper we discuss the level set method of Joó and how to use it to give an elementary proof of the well-known Sion’s minimax result. Although this proof technique is initiated by Joó and based on the inter-section of upper level sets and a clever use of the topological notion of...

In this paper we discuss the level set method of Joó and how to use it to give an elementary proof of the well-known Sion’s minimax result. Although this proof technique is initiated by Joó and based on the inter-section of upper level sets and a clever use of the topological notion of...

Each period, one outcome out of finitely many possibilities is observed. Each period, a forecaster announces some probability for the future outcomes based on the available data. An outsider wants to know if the forecaster has some knowledge of the data generating process. Let a test be an...