Computational economics
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.
93 records · Search and filter
- CS-826 Polynomial-time solution of rational P-matrix linear complementarity
- CS-827 Realistic equilibrium adjustment
- CS-828 Scalable heterogeneous-agent macroeconomics
- CS-829 The computational cost of minimax-optimal causal estimation
- CS-830 Exact complexity of Hylland--Zeckhauser allocation
- CS-831 Exact complexity of an Arrow--Debreu equilibrium
- CS-832 A combinatorial polynomial-time nucleolus algorithm for matching games
- CS-833 A polynomial-time approximation scheme for bimatrix Nash equilibrium
- CS-834 Computational complexity of optimin in finite games
- CS-835 High-precision information-value-free coarse correlated equilibrium
- CS-836 Exact normal-form correlated equilibrium from an extensive-form tree
- CS-837 Expected-polynomial exact Nash computation for random rational games
- CS-838 Extending descent-and-mixing methods to a fixed number of players
- CS-839 Strong approximation of Nash equilibria in concise potential games
- CS-840 Exact Nash complexity in concisely represented potential games
- CS-841 Improving search-and-mix approximation guarantees
- CS-842 Statistical confidence in game equilibria
- CS-843 Reduced-game validity
- CS-844 Critical Bernoulli densities for expected-polynomial Nash computation
- CS-845 Average-case analysis of specified search-and-mix algorithms
- CS-846 Structural classes with polynomial-time exact bimatrix Nash computation
- CS-847 Exact Nash computation in extensive-form games: resolved classification
- CS-848 Threshold Nash equilibrium in extensive form: resolved classification
- CS-849 Characterizing universal convergence of fictitious play
- CS-850 Payoff characterization of convergence for a fixed mirror-descent rule
- CS-851 Polynomial algorithms for games with ergodic payoff
- CS-852 Polynomial-time solution of simple stochastic games
- CS-853 Uniform coalition reachability with unknown population size
- CS-854 Minimax self-play regret under adversarially valid decentralized learning
- CS-855 Optimal dimension dependence of constant self-play regret
- CS-856 Finite-bit uncoupled learning with constant swap regret
- CS-857 Non-equilibrium learning attractors
- CS-858 Exact stationary equilibria with three or more discounted players
- CS-859 Constant regret in general-sum Markov games
- CS-860 Explicit constant-regret bounds for plain Optimistic Hedge
- CS-861 Learning with persistent states
- CS-862 Strategic queue stability
- CS-863 Learning in games and convergence
- CS-864 Threshold-constrained infinite-horizon equilibrium realizability
- CS-865 Certified feedback Nash approximations for nonlinear or time-varying games
- CS-866 Convergence of model-free learning in dynamic population games
- CS-867 Trajectory-error certificates for constrained feedback Nash approximations
- CS-868 Sharper approximation rates with stochastic action sets
- CS-869 Stable stochastic FTRL limit sets: boundary-containment agenda
- CS-870 One-to-one sink-equilibrium and replicator-attractor correspondence: false
- CS-871 Karlin's fictitious-play rate conjecture: disproved
- CS-872 The approximation threshold for unrestricted MAX-SMTI
- CS-873 Complexity-class membership of general supermatch existence
- CS-874 The approximation threshold for MAX-SMTI with one-sided ties
- CS-875 Complexity of reachability in the divorce digraph