Research map / Learning theory and algorithms / Submodular and game algorithms
Computing Least Cores of Supermodular Cooperative Games
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Cooperative Games With Bounded Dependency Degree (AAAI 2018 · similarity 0.89)
- Learning the Expected Core of Strictly Convex Stochastic Cooperative Games (NeurIPS 2024 · similarity 0.87)
- Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games (ICML 2025 · similarity 0.85)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.85)
- Sequential Solution Concepts in Cooperative Games with Generalized Characteristic Functions (NeurIPS 2026 · similarity 0.85)
- Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.