On the complexity of succinct zero-sum games
From MaRDI portal
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational learning theory (68Q32) 2-person games (91A05)
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 landscape of communication complexity classes
- Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity
- On Dedekind's problem for complete simple games
- On zero error algorithms having oracle access to one query
- The complexity of estimating min-entropy
- Simple strategies for large zero-sum games with applications to complexity theory
- The complexity of the nucleolus in compact games
- On the Complexity of n-Player Hackenbush
- Weighted Boolean formula games
- On the Complexity of Equilibria Problems in Angel-Daemon Games
- Parallel approximation of min-max problems
- Arthur and Merlin as Oracles
- On the complexity of problems on simple games
- Complexity limitations on one-turn quantum refereed games
- Arthur and Merlin as oracles
- The 1-versus-2 queries problem revisited
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)
