Research map / Learning theory and algorithms / Combinatorial and search optimization
Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking
Jun Wang, Sujoy Sikdar, Tyler Shepherd, Zhibing Zhao, Chunheng Jiang, Lirong Xia
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 machine-learning local priority instead of unprioritized DFS (ablation) | PUT-STV · Synthetic hard profiles (m=n=30) | Avg. 100%-discovery time: 0.1820 -> 0.1686 | Improved |
| Use machine-learning local priority instead of unprioritized DFS (ablation) | PUT-STV · Synthetic hard profiles (m=n=30) | Avg. running time: 0.4474 -> 0.5017 | Hurt |
| Add 600 random samples to LPML (ablation) | PUT-STV · Synthetic hard profiles (m=n=30) | Avg. running time: 0.5017 -> 0.6893 | Hurt |
| Add 30 random samples to LPML (ablation) | PUT-STV · Synthetic hard profiles (m=n=30) | Avg. running time: 0.5017 -> 0.5252 | Hurt |
| Add random sampling to LPML (ablation) | PUT-STV · Synthetic hard profiles (m=n=30) | Avg. 100%-discovery time: 0.1686 -> 0.3563 (600 samples); 0.1686 -> 0.1826 (30 samples) | Hurt |
| Add pruning to PUT-STV DFS (ablation) | PUT-STV · Synthetic profiles with m=n=10, m=n=20, and m=n=30 | Avg. running time reduction: 0.33%; 2.26%; 4.51% | No clear effect |
| Use MC(LP) with candidate-count local priority instead of nDFS(LP) (ablation) | PUT-RP · Synthetic hard profiles (m=n=10) | Avg. running time: 7.6571 -> 7.7081 | No clear effect |
| Use machine-learning local priority instead of candidate-count local priority (ablation) | PUT-RP · Synthetic hard profiles (m=n=10) | Avg. running time: 7.7081 -> 7.9858 | No clear effect |
| Use machine-learning local priority instead of candidate-count local priority (ablation) | PUT-RP · Synthetic hard profiles (m=n=10) | Avg. 100%-discovery time: 6.4058 -> 6.7876 | Hurt |
| Add 200 samples to MC(LP) (ablation) | PUT-RP · Synthetic hard profiles (m=n=10) | Avg. running time: 7.7081 -> 2.8692 | Improved |
| Add 200 samples to MC(LP) (ablation) | PUT-RP · Synthetic hard profiles (m=n=10) | Avg. 100%-discovery time: 6.4058 -> 0.0823 | Improved |
| Add pruning to PUT-RP DFS (ablation) | PUT-RP · 531 hard profiles | Avg. running time: 125.31 -> 2.23 seconds | Improved |
Closest papers by meaning
- Temporal Fairness in Multiwinner Voting (AAAI 2024 · similarity 0.84)
- Multi-Winner Reconfiguration (NeurIPS 2024 · similarity 0.83)
- The Surprising Effectiveness of SP Voting with Partial Preferences (NeurIPS 2024 · similarity 0.83)
- Proportional Aggregation of Preferences for Sequential Decision Making (AAAI 2024 · similarity 0.83)
- Maintaining Proportional Committees with Dynamic Candidate Sets (ICML 2025 · similarity 0.82)
- Exact power indices for plurality-voting ensembles (NeurIPS 2026 · similarity 0.82)
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.
