Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game
この論文をさがす
説明
About a symmetric three-players zero-sum game we will show the following results. A modified version of Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy are proved by the existence of a symmetric Nash equilibrium. The existence of a symmetric Nash equilibrium is proved by the modified version of Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy. Thus, they are equivalent. However, without the coincidence of the maximin strategy and the minimax strategy there may exist an asymmetric equilibrium in a symmetric three-players zero-sum game.
収録刊行物
-
- International Journal of Mathematics in Operational Research
-
International Journal of Mathematics in Operational Research 1 (1), 1-, 2019
Inderscience Publishers
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1361131642517428736
-
- ISSN
- 17575869
- 17575850
-
- 資料種別
- journal article
-
- データソース種別
-
- Crossref
- KAKEN
- OpenAIRE