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-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
- CS-876 Approximating the least unpopularity margin
- CS-877 Output-sensitive enumeration of weakly stable matchings with ties
- CS-878 Approximating the least unpopularity factor in house allocation
- 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