AI-assisted proof shows no voting rule beats Borda on strategyproofness
conitzer · x · 2026-11-11
Vincent Conitzer announces a major update to arXiv paper 2602.22838: co-author Emin Berker, with AI assistance, proved a deep result that no reasonable voting rule is closer to strategy-proof than Borda Count. The paper measures strategic voters' advantage via resource augmentation — how many duplicate truthful votes must be added to match their best manipulation. Many rules' manipulation leverage grows linearly with voters, while Borda's is m-2; Borda is optimal among positional scoring rules when voters outnumber candidates, plurality otherwise.
More from AGI Musings
- Viral post: five years of 'maybe next year,' then 2026 arrived — hey_abusiddik · 2026-11-11
- 'Chat with your data' misses the point — people want a smart coworker — vboykis · 2026-11-11
- Ben Todd: AI task time horizons appear superexponential in AECI, not just revenue — ben_j_todd · 2026-11-11
- When AI becomes an oracle, what happens to mathematics? — stevenstrogatz · 2026-11-11
- David Patterson: superintelligence will end profit and equity growth, only sales-tax-funded universal high income works — davidpattersonx · 2026-11-11
- Even after a 6-month recursive leap, AI progress stays 3x the 2024 rate — ben_j_todd · 2026-11-11