A theorem on symmetric two-player zero-sum games
From MaRDI portal
Publication:1363375
DOI10.1006/JETH.1996.2215zbMATH Open0881.90132OpenAlexW1971753971MaRDI QIDQ1363375FDOQ1363375
Michel Le Breton, Jean-François Laslier, Gilbert Laffond
Publication date: 28 September 1997
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jeth.1996.2215
Recommendations
Cites Work
Cited In (11)
- Title not available (Why is that?)
- Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- A natural adaptive process for collective decision-making
- Nash equilibria and values through modular partitions in infinite games
- On the uniqueness of optimal strategies in symmetric matrix games
- The distribution of optimal strategies in symmetric zero-sum games
- Title not available (Why is that?)
- On the tradeoff between efficiency and strategyproofness
- An analytical and experimental comparison of maximal lottery schemes
- Choosing from a weighted tournament
This page was built for publication: A theorem on symmetric two-player zero-sum games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363375)