Research map / Learning theory and algorithms / Sample complexity
On the Complexity of mCP-nets
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
- Unravelling Expressive Delegations: Complexity and Normative Analysis (AAAI 2024 · similarity 0.86)
- The Complexity of Subelection Isomorphism Problems (AAAI 2022 · similarity 0.86)
- Approximation Algorithms for Preference Aggregation Using CP-Nets (AAAI 2024 · similarity 0.85)
- Constant-Factor Distortion Mechanisms for k-Committee Election (AAAI 2025 · similarity 0.84)
- Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity (AAAI 2025 · similarity 0.84)
- Welfare Maximization in Perpetual Voting (Student Abstract) (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.