Research map / Learning theory and algorithms / Submodular and game algorithms
Identifying Imperfect Clones in Elections
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
- The Complexity of Subelection Isomorphism Problems (AAAI 2022 · similarity 0.88)
- How Similar Are Two Elections? (AAAI 2019 · similarity 0.88)
- On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries (AAAI 2025 · similarity 0.85)
- Maintaining Proportional Committees with Dynamic Candidate Sets (ICML 2025 · similarity 0.85)
- Replicating Electoral Success (AAAI 2025 · similarity 0.84)
- Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences (NeurIPS 2026 · 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.
