Research map / Learning theory and algorithms / Sample complexity
The Complexity of Subelection Isomorphism Problems
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 |
|---|---|---|---|
| Use the urn model with α=0.1 instead of Mallows elections | Election generation · Identity-model similarity, 10 candidates | matched votes: 21±8% vs around 2% | Helped |
| Increase urn parameter from α=0.1 to α=0.5 | Urn model · Identity-model similarity, 10 candidates | matched votes: 21±8% -> 49±17% | Helped |
Closest papers by meaning
- How Similar Are Two Elections? (AAAI 2019 · similarity 0.91)
- Identifying Imperfect Clones in Elections (AAAI 2026 · similarity 0.88)
- On the Complexity of mCP-nets (AAAI 2016 · similarity 0.86)
- Algorithms for Structured Elections Under Thiele Voting Rules (AAAI 2026 · similarity 0.85)
- Very Hard Electoral Control Problems (AAAI 2019 · similarity 0.84)
- Proportional Fairness in Clustering: A Social Choice Perspective (NeurIPS 2024 · similarity 0.83)
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.