Algorithmic game theory
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. 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.
16 records · Search and filter
- Math-436 Matroid Secretary Conjecture
- Math-482 Polynomial-Time Solvability of Condon's Simple Stochastic Games
- Math-2420 Polynomial Algorithms for Mean-Payoff Games and Linear Programming
- Math-2983 Quasipolynomial mean-payoff/parity winning sets
- Math-2988 One-sample matroid prophet selection
- Math-2991 Deterministic quasipolynomial mean-payoff games
- Math-2998 Quasilinear robust PCP for PPAD
- Math-3004 Quasipolynomial stochastic mean-payoff decision
- Math-4482 Quantitative Manipulability of Social Choice Functions
- Math-4483 Individual Manipulation Power in Neutral Social Choice
- Math-4540 Uniqueness of Equilibria in Rank-One Bimatrix Games
- Math-4619 Nash Equilibria over Unbounded Measure Spaces
- Math-4634 Semidefinite Relaxations for Quantum Equilibria
- Math-4987 Game Theory at Scale
- Math-5317 Finite Strategies in the Distance Game
- Math-5318 Duplicate Finite-Strategy Question for the Distance Game