A theorem on symmetric two-player zero-sum games
From MaRDI portal
Publication:1363375
Recommendations
Cites work
Cited in
(15)- An analytical and experimental comparison of maximal lottery schemes
- scientific article; zbMATH DE number 3999712 (Why is no real title available?)
- On symmetric linear games
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- On Completely Mixed Games
- Choosing from a weighted tournament
- Nash equilibria and values through modular partitions in infinite games
- The distribution of optimal strategies in symmetric zero-sum games
- On the tradeoff between efficiency and strategyproofness
- The equivalence of mini-max theorem and existence of Nash equilibrium in asymmetric three-players zero-sum game with two groups
- On the uniqueness of optimal strategies in symmetric matrix games
- An undecidable statement regarding zero-sum games
- A natural adaptive process for collective decision-making
- Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game
- scientific article; zbMATH DE number 6866346 (Why is no real title available?)
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)