Research map / Learning theory and algorithms / Submodular and game algorithms
How Similar Are Two 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Increase number of voters from 6 to 16 | Local search heuristic for Spearman isomorphism distance · Random elections (IC, 1D Interval, 2D Disc), 6 candidates | average approximation ratio: at most 1.5 | Helped |
| Use local search heuristic instead of CPLEX ILP | Spearman isomorphism distance computation · Random elections | running time ratio | Helped |
| Increase election size from 9x9 to 10x10 (voters x candidates) | ILP solver · Spearman isomorphism distance | solve time: 8 seconds -> 40 seconds | Hurt |
Closest papers by meaning
- The Complexity of Subelection Isomorphism Problems (AAAI 2022 · similarity 0.91)
- Identifying Imperfect Clones in Elections (AAAI 2026 · similarity 0.88)
- On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries (AAAI 2025 · similarity 0.86)
- An Analysis Framework for Metric Voting based on LP Duality (AAAI 2020 · similarity 0.86)
- Constant-Factor Distortion Mechanisms for k-Committee Election (AAAI 2025 · similarity 0.86)
- Maintaining Proportional Committees with Dynamic Candidate Sets (ICML 2025 · 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.