Metraipolis › archive › dc_b25e044c22d3

Improving Randomized Metric Distortion to 2.1441 — arXiv:2608.29308

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29308
License (as archived)
CC0-1.0
Archived
2026-10-17T07:47:39.982Z
SHA-256 of the archived text
9d7bbecb502c183e61c4573208e3db722c0dd7c290ffbc2dd9fe2fc9b743fd72
Stable URL of this page
https://metraipolis.com/documento/dc_b25e044c22d3

How to cite

Improving Randomized Metric Distortion to 2.1441 — arXiv:2608.29308 — arXiv (en), https://arxiv.org/abs/2608.29308 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b25e044c22d3 (Metraipolis archive dc_b25e044c22d3, sha256 9d7bbecb502c183e61c4573208e3db722c0dd7c290ffbc2dd9fe2fc9b743fd72)
BibTeX
@misc{dcb25e044c22d3,
  title = {Improving Randomized Metric Distortion to 2.1441 — arXiv:2608.29308},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29308},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b25e044c22d3; sha256 9d7bbecb502c183e61c4573208e3db722c0dd7c290ffbc2dd9fe2fc9b743fd72},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29308. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 best distortion of deterministic rules is $3$, prior work pins down the best distortion of randomized rules to $[2.1126,2.5]$. We improve the upper bound to $2.1441$, closing over $90\%$ of this gap. The proof introduces random-size stable lotteries, proves their existence, and derives the new bound through a potential argument. All the proofs were obtained using GPT-5.6-Sol with significant guidance from the author, who verified them and simplified the exposition.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.AI).
Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2608.29308 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T07:28:26.745Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).