Computer Science
Open problems, research attempts and community review.
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.
918 records · Search and filter
- 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