On the complexity of succinct zero-sum games
From MaRDI portal
Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)
Recommendations
- Simple strategies for large zero-sum games with applications to complexity theory
- On the complexity of approximating a Nash equilibrium
- scientific article; zbMATH DE number 6783488
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- The complexity of two-person zero-sum games in extensive form
Cited in
(16)- The complexity of estimating min-entropy
- The 1-versus-2 queries problem revisited
- On the complexity of problems on simple games
- Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity
- Weighted Boolean formula games
- Complexity limitations on one-turn quantum refereed games
- The complexity of the nucleolus in compact games
- Arthur and Merlin as Oracles
- The landscape of communication complexity classes
- On zero error algorithms having oracle access to one query
- On the Complexity of Equilibria Problems in Angel-Daemon Games
- Parallel approximation of min-max problems
- Arthur and Merlin as oracles
- Simple strategies for large zero-sum games with applications to complexity theory
- On the Complexity of n-Player Hackenbush
- On Dedekind's problem for complete simple games
This page was built for publication: On the complexity of succinct zero-sum games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024660)
