Research map / Learning theory and algorithms / Submodular and game algorithms
The Semi-Random Satisfaction of Voting Axioms
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 |
|---|---|---|---|
| compare voting rules satisfying CC (Black, Maximin, Schulze, Ranked Pairs, Copeland) vs Plurality/Borda/Veto/STV under semi-random model | voting rules · semi-random model with IC | CC satisfaction | Helped |
| Veto instead of other rules on real Preflib data | Veto · Preflib, CC | CC satisfaction: 100% -> 74.2% | Hurt |
| Plurality to Borda to Veto | voting rule · Preflib, CC | CC satisfaction: 96.8% -> 92.4% -> 74.2% | Hurt |
| Black voting rule instead of STV for participation | voting rule · Preflib, PAR | PAR satisfaction: 99.7% -> 99.4% | Hurt |
Closest papers by meaning
- Semi-random Impossibilities of Condorcet Criterion (AAAI 2023 · similarity 0.92)
- Weak Strategyproofness in Randomized Social Choice (AAAI 2025 · similarity 0.89)
- Tight Bounds on the Distortion of Randomized and Deterministic Distributed Voting (NeurIPS 2025 · similarity 0.87)
- Optimal Bounds for Dissatisfaction in Perpetual Voting (AAAI 2025 · similarity 0.86)
- Proportional Aggregation of Preferences for Sequential Decision Making (AAAI 2024 · similarity 0.86)
- Independence of Irrelevant Alternatives under the Lens of Pairwise Distortion (AAAI 2024 · similarity 0.85)
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.