Economics catalogue
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.
90 records · Search and filter
- CS-879 Approximating MAX-SMTI under master-list restrictions
- CS-880 Approximating the minimum repair budget for one-failure supermatches
- CS-881 Stable-roommates robustness to preference perturbations
- CS-882 House exchanges along longer social-network cycles
- CS-883 Growing numbers of changed agents: correcting an overbroad complexity promise
- CS-884 A most-probably popular house allocation
- CS-885 A matching with highest stability probability in the lottery model
- CS-886 Parameterized computation of a reachable Pareto-optimal allocation
- CS-887 A most-probably rank-maximal house allocation
- CS-888 Popularity probability under uncertain house-allocation preferences
- CS-889 Parameterized reachability of allocations by improving swaps
- CS-890 Stability probability under compact indifference
- CS-891 Efficient Birkhoff representation of two-sided robust stable matchings
- CS-892 Rank-maximality probability under uncertain preferences
- CS-893 A multiplayer extension of Weber-law bargaining
- CS-894 Encoding and complexity of token-rich Battle Sheep
- CS-895 Simple combinatorial bidding
- CS-896 Constant prophet bounds for subadditive bidders: corrected target
- CS-897 Computing median prices for XOS valuations
- CS-898 Improving approximation for distance-based RAG data auctions
- CS-899 Adaptive market maintenance
- CS-900 Polynomial-time exact EFX search for additive goods
- CS-901 Polynomial-time construction with subquadratic envy-free subsidies
- CS-902 Finite exact cake-cutting protocols for mixed-resource EFM
- CS-903 Polynomial-time computation of simultaneous EEFX and EFL allocations
- CS-904 Complexity of verifying epistemic EFX for additive goods
- CS-905 The optimal randomized ordinal metric-distortion constant
- CS-906 Welfare with limited preference information
- CS-907 Constant distortion using one round of linearly many comparisons
- CS-908 The midpoint satisfaction threshold in budget division
- CS-909 Manipulation-resistant learning
- CS-910 Multidimensional screening
- CS-911 Gross substitutes: truthfulness versus communication constraints
- CS-912 Optimal universally truthful facility location in the plane
- CS-913 Dynamic strategyproof facility location with relocation costs
- CS-914 Dimension dependence in learning a game by payments
- CS-915 Markov persuasion regret--violation tradeoffs: resolved gap
- CS-916 Approximating receiver-optimal cheap-talk equilibria
- CS-917 Strongly polynomial computation of an optimal finite contract
- CS-918 Approximation frontier for randomized inspection contracts