Metraipolis › archive › dc_5acd7bc557cf

Optimally Selecting Representative Agents from a Metric Space — arXiv:2608.29097

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29097
License (as archived)
CC0-1.0
Archived
2026-10-17T08:19:23.633Z
SHA-256 of the archived text
dee0ed490269b0edb092f84fbaeebff2c93e2f5fbd75606e98416269f87b378d
Stable URL of this page
https://metraipolis.com/documento/dc_5acd7bc557cf

How to cite

Optimally Selecting Representative Agents from a Metric Space — arXiv:2608.29097 — arXiv (en), https://arxiv.org/abs/2608.29097 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5acd7bc557cf (Metraipolis archive dc_5acd7bc557cf, sha256 dee0ed490269b0edb092f84fbaeebff2c93e2f5fbd75606e98416269f87b378d)
BibTeX
@misc{dc5acd7bc557cf,
  title = {Optimally Selecting Representative Agents from a Metric Space — arXiv:2608.29097},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29097},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5acd7bc557cf; sha256 dee0ed490269b0edb092f84fbaeebff2c93e2f5fbd75606e98416269f87b378d},
  year = {2026}
}

Archived text

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

This paper studies the problem of proportionally fair clustering, where the goal is to select $k$ ``centers'' from a metric space that fairly represent a set of agents who also lie in the metric space. Specifically, we focus on finding a clustering satisfying a fairness property known as the Droop core. In the practical special case in which the set of feasible center locations contains every agent location, the previous best-known result guaranteed a $(1 + \sqrt{2})$-approximation of the Droop core, while the best-known lower bound was $2$. In this paper, we show that this lower bound is tight and that a clustering in the $2$-Droop core always exists. Further, we show that such a clustering can be achieved by only selecting centers from locations in the metric space where an agent resides. We establish this using Scarf's theorem guaranteeing a nonempty core for balanced non-transferable utility games. This result has several interesting corollaries. Most notably, it resolves the $\beta$-plurality problem of Aronov et al. [2021] for general metric spaces. The main result of this paper was generated by $\mathtt{ChatGPT}$-$\mathtt{5.6}$-$\mathtt{Sol}$ through a series of interactions with the authors. The authors of this paper verified the generated proof and rewrote it for clarity.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-01 in cs.GT).
Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.29097 — 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-17T08:08:10.905Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).