Algorithmic game theory
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
19 records · Search and filter
- CS-79 Matroid Secretary Conjecture
- CS-83 Polynomial-Time Solvability of Condon's Simple Stochastic Games
- CS-114 Polynomial Algorithms for Mean-Payoff Games and Linear Programming
- CS-141 Quasipolynomial mean-payoff/parity winning sets
- CS-146 One-sample matroid prophet selection
- CS-149 Deterministic quasipolynomial mean-payoff games
- CS-156 Quasilinear robust PCP for PPAD
- CS-162 Quasipolynomial stochastic mean-payoff decision
- CS-293 Quantitative Manipulability of Social Choice Functions
- CS-294 Individual Manipulation Power in Neutral Social Choice
- CS-351 Uniqueness of Equilibria in Rank-One Bimatrix Games
- CS-430 Nash Equilibria over Unbounded Measure Spaces
- CS-445 Semidefinite Relaxations for Quantum Equilibria
- CS-452 Game Theory at Scale
- CS-782 Finite Strategies in the Distance Game
- CS-783 Duplicate Finite-Strategy Question for the Distance Game
- CS-855 Optimal dimension dependence of constant self-play regret
- CS-856 Finite-bit uncoupled learning with constant swap regret
- CS-860 Explicit constant-regret bounds for plain Optimistic Hedge