Minimax theorem and Nash equilibrium of symmetric multi-players zero-sum game with two strategic variables

Masahiko Hattori (), Atsuhiro Satoh () and Yasuhito Tanaka

Papers from arXiv.org

Abstract: We consider a symmetric multi-players zero-sum game with two strategic variables. There are $n$ players, $n\geq 3$. Each player is denoted by $i$. Two strategic variables are $t_i$ and $s_i$, $i\in \{1, \dots, n\}$. They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nash equilibria in the following states are equivalent. 1. All players choose $t_i,\ i\in \{1, \dots, n\}$, (as their strategic variables). 2. Some players choose $t_i$'s and the other players choose $s_i$'s. 3. All players choose $s_i,\ i\in \{1, \dots, n\}$.

Date: 2018-06
New Economics Papers: this item is included in nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://arxiv.org/pdf/1806.07203 Latest version (application/pdf)

Related works:
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:arx:papers:1806.07203

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().