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-200 Computing median prices for XOS valuations
- Econ-203 Improving search-and-mix approximation guarantees
- Econ-207 Approximating MAX-SMTI under master-list restrictions
- Econ-213 Exact complexity of an Arrow--Debreu equilibrium
- Econ-217 Approximating the minimum repair budget for one-failure supermatches
- Econ-222 Approximating receiver-optimal cheap-talk equilibria
- Econ-241 Stable-roommates robustness to preference perturbations
- Econ-256 Learning in games and convergence
- Econ-268 Constant distortion using one round of linearly many comparisons
- Econ-272 House exchanges along longer social-network cycles
- Econ-289 Statistical confidence in game equilibria
- Econ-297 Growing numbers of changed agents: correcting an overbroad complexity promise
- Econ-303 A combinatorial polynomial-time nucleolus algorithm for matching games
- Econ-342 A most-probably popular house allocation
- Econ-357 A matching with highest stability probability in the lottery model
- Econ-370 Reduced-game validity
- Econ-373 Parameterized computation of a reachable Pareto-optimal allocation
- Econ-377 A most-probably rank-maximal house allocation
- Econ-391 Popularity probability under uncertain house-allocation preferences
- Econ-395 Threshold-constrained infinite-horizon equilibrium realizability
- Econ-396 Parameterized reachability of allocations by improving swaps
- Econ-405 Certified feedback Nash approximations for nonlinear or time-varying games
- Econ-421 Stability probability under compact indifference
- Econ-428 Efficient Birkhoff representation of two-sided robust stable matchings
- Econ-449 Convergence of model-free learning in dynamic population games
- Econ-468 Rank-maximality probability under uncertain preferences
- Econ-491 Trajectory-error certificates for constrained feedback Nash approximations
- Econ-492 Critical Bernoulli densities for expected-polynomial Nash computation
- Econ-517 Dimension dependence in learning a game by payments
- Econ-536 Sharper approximation rates with stochastic action sets
- Econ-593 Average-case analysis of specified search-and-mix algorithms
- Econ-601 Stable stochastic FTRL limit sets: boundary-containment agenda
- Econ-623 A multiplayer extension of Weber-law bargaining
- Econ-624 Structural classes with polynomial-time exact bimatrix Nash computation
- Econ-652 The midpoint satisfaction threshold in budget division
- Econ-653 One-to-one sink-equilibrium and replicator-attractor correspondence: false
- Econ-654 Markov persuasion regret--violation tradeoffs: resolved gap
- Econ-655 Karlin's fictitious-play rate conjecture: disproved
- Econ-657 Complexity of verifying epistemic EFX for additive goods
- Econ-658 Improving approximation for distance-based RAG data auctions
- Econ-659 Exact Nash computation in extensive-form games: resolved classification
- Econ-660 Threshold Nash equilibrium in extensive form: resolved classification
- Econ-661 Encoding and complexity of token-rich Battle Sheep