Computational economics
Inherited economics order with provisional editorial placements for new problems; ranks are independent of permanent problem identifiers. About rankings
Browse by JEL classification
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
- Econ-2 A polynomial-time approximation scheme for bimatrix Nash equilibrium
- Econ-4 Computational complexity of optimin in finite games
- Econ-9 The optimal randomized ordinal metric-distortion constant
- Econ-11 Characterizing universal convergence of fictitious play
- Econ-15 Payoff characterization of convergence for a fixed mirror-descent rule
- Econ-18 Polynomial-time solution of rational P-matrix linear complementarity
- Econ-19 Polynomial algorithms for games with ergodic payoff
- Econ-21 Polynomial-time solution of simple stochastic games
- Econ-22 Strongly polynomial computation of an optimal finite contract
- Econ-23 Polynomial-time exact EFX search for additive goods
- Econ-32 High-precision information-value-free coarse correlated equilibrium
- Econ-36 Scalable heterogeneous-agent macroeconomics
- Econ-37 Exact normal-form correlated equilibrium from an extensive-form tree
- Econ-48 The computational cost of minimax-optimal causal estimation
- Econ-52 Uniform coalition reachability with unknown population size
- Econ-64 Minimax self-play regret under adversarially valid decentralized learning
- Econ-65 Optimal dimension dependence of constant self-play regret
- Econ-66 Manipulation-resistant learning
- Econ-72 Polynomial-time construction with subquadratic envy-free subsidies
- Econ-73 Non-equilibrium learning attractors
- Econ-84 Exact stationary equilibria with three or more discounted players
- Econ-92 Finite exact cake-cutting protocols for mixed-resource EFM
- Econ-94 Multidimensional screening
- Econ-96 Gross substitutes: truthfulness versus communication constraints
- Econ-97 Adaptive market maintenance
- Econ-108 The approximation threshold for unrestricted MAX-SMTI
- Econ-110 Simple combinatorial bidding
- Econ-115 Constant regret in general-sum Markov games
- Econ-116 Finite-bit uncoupled learning with constant swap regret
- Econ-119 Complexity-class membership of general supermatch existence
- Econ-125 The approximation threshold for MAX-SMTI with one-sided ties
- Econ-130 Constant prophet bounds for subadditive bidders: corrected target
- Econ-134 Expected-polynomial exact Nash computation for random rational games
- Econ-135 Approximation frontier for randomized inspection contracts
- Econ-138 Extending descent-and-mixing methods to a fixed number of players
- Econ-139 Complexity of reachability in the divorce digraph
- Econ-145 Strong approximation of Nash equilibria in concise potential games
- Econ-148 Learning with persistent states
- Econ-152 Exact complexity of Hylland--Zeckhauser allocation
- Econ-154 Optimal universally truthful facility location in the plane
- Econ-156 Exact Nash complexity in concisely represented potential games
- Econ-162 Strategic queue stability
- Econ-163 Explicit constant-regret bounds for plain Optimistic Hedge
- Econ-169 Approximating the least unpopularity margin
- Econ-176 Dynamic strategyproof facility location with relocation costs
- Econ-179 Output-sensitive enumeration of weakly stable matchings with ties
- Econ-181 Polynomial-time computation of simultaneous EEFX and EFL allocations
- Econ-182 Approximating the least unpopularity factor in house allocation
- Econ-184 Welfare with limited preference information
- Econ-186 Realistic equilibrium adjustment