arXiv (All)
open access
Improving Randomized Metric Distortion to 2.1441
In metric social choice, voters rank candidates by their distances in an unknown metric space. A voting rule uses these rankings to select a candidate or a lottery over candidates, aiming to minimize the average distance to voters. Distortion measures the worst-case approximation ratio. While the be
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
- Bayesian Risk Preference Persuasion#1049922
- Condorcet-Winning Sets and Peer Selection in Planar Metric Elections#780953
- Condorcet-Winning Sets and Peer Selection in Planar Metric Elections#779578
- Proportional Representation in Temporal Voting with Ranked Preferences#1104754
- Improved Multiplayer Bandit Algorithm for Bernoulli Rewards#1062113
Record · ID 974588
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