Research map / Learning theory and algorithms / Submodular and game algorithms
Complexity of Hedonic Games with Dichotomous Preferences
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
- Complexity of Probabilistic Inference in Random Dichotomous Hedonic Games (AAAI 2023 · similarity 0.94)
- Stability in Online Coalition Formation (AAAI 2024 · similarity 0.90)
- Individually Stable Dynamics in Coalition Formation over Graphs (AAAI 2025 · similarity 0.87)
- Learning Coalition Structures with Games (AAAI 2024 · similarity 0.87)
- Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity (AAAI 2025 · similarity 0.86)
- The Complexity of Computing Robust Mediated Equilibria in Ordinal Games (AAAI 2024 · similarity 0.86)
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.