JEL C72 — Noncooperative Games
Inherited economics order with provisional editorial placements for new problems; ranks are independent of permanent problem identifiers. About rankings
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
- Econ-2 A polynomial-time approximation scheme for bimatrix Nash equilibrium
- Econ-4 Computational complexity of optimin in finite games
- Econ-14 The Catch-Up optimal-draw conjecture for consecutive integers
- Econ-32 High-precision information-value-free coarse correlated equilibrium
- Econ-37 Exact normal-form correlated equilibrium from an extensive-form tree
- Econ-53 Games with constrained Nash equilibria for every feasible outside option
- Econ-134 Expected-polynomial exact Nash computation for random rational games
- Econ-138 Extending descent-and-mixing methods to a fixed number of players
- Econ-145 Strong approximation of Nash equilibria in concise potential games
- Econ-156 Exact Nash complexity in concisely represented potential games
- Econ-203 Improving search-and-mix approximation guarantees
- Econ-289 Statistical confidence in game equilibria
- Econ-370 Reduced-game validity
- Econ-492 Critical Bernoulli densities for expected-polynomial Nash computation
- Econ-493 Equilibrium selection in games
- Econ-593 Average-case analysis of specified search-and-mix algorithms
- Econ-624 Structural classes with polynomial-time exact bimatrix Nash computation
- Econ-659 Exact Nash computation in extensive-form games: resolved classification
- Econ-660 Threshold Nash equilibrium in extensive form: resolved classification