arXiv (All)
open access
Maximal number of mixed Nash equilibria in generic games where each player has two pure strategies
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 nu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games#1050734
- The Category Gm for Extensive-Form Games#997879
- Subgame Perfection in Graph Games with $ω$-Recognizable Preference Relations#1037589
- A characterization of subgame perfect equilibria in single-leader multi-follower games#365635
- Maker-Breaker Largest Connected Subgraph Game in Trees#1090704
Record · ID 1104831
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive