Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game

Atsuhiro Satoh () and Yasuhito Tanaka

International Journal of Mathematics in Operational Research, 2020, vol. 16, issue 2, 279-289

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

Keywords: three-players zero-sum game; Nash equilibrium; Sion's minimax theorem. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=105859 (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game (2018)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:16:y:2020:i:2:p:279-289

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().