Maximal number of mixed Nash equilibria in generic games where each player has two pure strategies
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929646122041344 |
|---|---|
| author | Hertling, Claus Vujic, Matija |
| author_facet | Hertling, Claus Vujic, Matija |
| contents | The number of Nash equilibria of the mixed extension of a generic finite game in normal form is finite and odd. This raises the question how large the number can be, depending on the number of players and the numbers of their pure strategies. Here we present a lower bound for the maximal possible number in the case of m-player games where each player has two pure strategies. It is surprisingly close to a known upper bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_17890 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Maximal number of mixed Nash equilibria in generic games where each player has two pure strategies Hertling, Claus Vujic, Matija Combinatorics Computer Science and Game Theory Optimization and Control 91A06, 91A10, 05A05 The number of Nash equilibria of the mixed extension of a generic finite game in normal form is finite and odd. This raises the question how large the number can be, depending on the number of players and the numbers of their pure strategies. Here we present a lower bound for the maximal possible number in the case of m-player games where each player has two pure strategies. It is surprisingly close to a known upper bound. |
| title | Maximal number of mixed Nash equilibria in generic games where each player has two pure strategies |
| topic | Combinatorics Computer Science and Game Theory Optimization and Control 91A06, 91A10, 05A05 |
| url | https://arxiv.org/abs/2412.17890 |