arXiv (All)
open access
Deterministic Metric Distortion of Top-2 Voting
We give tight bounds on the metric distortion of top-2 deterministic voting mechanisms. We first exploit the restrictive structure of top-2 voting to reduce the space of worst-case metrics from the continuum of biased metrics to $2^n$ subset metrics, where every candidate has distance $0$ or $1$ to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Outer Diversity of Condorcet Domains#1155655
- Game-Theoretic Robustness in Cooperation and Prejudice Reduction: A Graphic Measure#737767
- Decisive Margins in Differentially Private Voting#467077
- Jury Theorems#732678
- TV between Bernoulli products, up to constants#1013821
Record · ID 1326340
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive