Showing 1 - 10 of 729
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...
Persistent link: https://www.econbiz.de/10010681745
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...
Persistent link: https://www.econbiz.de/10010576437
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...
Persistent link: https://www.econbiz.de/10010731303
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...
Persistent link: https://www.econbiz.de/10010731773
In this paper, we presented new and important existence theorems of solution for quasi-equilibrium problems, and we show the uniqueness of its solution which is also a fixed point of some mapping. We also show that this unique solution can be obtained by Picard’s iteration method. We also get...
Persistent link: https://www.econbiz.de/10010896387
Motivated by the Suzuki’s type fixed point theorems, we give several new existence theorems for scalar quasi-equilibrium problems, and vector quasi-equilibrium problem on complete metric spaces. We give important examples for our results. Note that the solution of quasi-equilibrium problem...
Persistent link: https://www.econbiz.de/10010896458
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...
Persistent link: https://www.econbiz.de/10010845503
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...
Persistent link: https://www.econbiz.de/10010845861
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...
Persistent link: https://www.econbiz.de/10005598530
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...
Persistent link: https://www.econbiz.de/10005288509