Research map / Learning theory and algorithms / Submodular and game algorithms
How Hard Is It to Explain Preferences Using Few Boolean Attributes?
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
- Exact Learning of Preference Structure: Single-peaked Preferences and Beyond (ICML 2022 · similarity 0.88)
- Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information (AAAI 2021 · similarity 0.87)
- Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice (AAAI 2019 · similarity 0.85)
- Independence of Irrelevant Alternatives under the Lens of Pairwise Distortion (AAAI 2024 · similarity 0.85)
- Weak Strategyproofness in Randomized Social Choice (AAAI 2025 · similarity 0.84)
- Proportional Aggregation of Preferences for Sequential Decision Making (AAAI 2024 · similarity 0.84)
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.