Ranked Pairs minimizes the $p$-norm as $p \to \infty$
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912479528878080 |
|---|---|
| author | Aazami, Amir Babak Bray, Hubert L. |
| author_facet | Aazami, Amir Babak Bray, Hubert L. |
| contents | We prove that Ranked Pairs orders candidates in such a way as to minimize the $p$-norm, in the limit as $p \to \infty$, of those head-to-head margins of victory which go against its ordering. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_09654 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Ranked Pairs minimizes the $p$-norm as $p \to \infty$ Aazami, Amir Babak Bray, Hubert L. Theoretical Economics Computer Science and Game Theory We prove that Ranked Pairs orders candidates in such a way as to minimize the $p$-norm, in the limit as $p \to \infty$, of those head-to-head margins of victory which go against its ordering. |
| title | Ranked Pairs minimizes the $p$-norm as $p \to \infty$ |
| topic | Theoretical Economics Computer Science and Game Theory |
| url | https://arxiv.org/abs/2507.09654 |