BallotRank: A Condorcet Completion Method for Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911388673245184 |
|---|---|
| author | Todd, Jason Douglas Volic, Ismar |
| author_facet | Todd, Jason Douglas Volic, Ismar |
| contents | We introduce BallotRank, a ranked preference aggregation method derived from a modified PageRank algorithm. It is a Condorcet-consistent method without damping, and empirical examination of nearly 2,000 ranked choice elections and over 20,000 internet polls confirms that BallotRank always identifies the Condorcet winner at conventional values of the damping parameter. We also prove that the method satisfies many of the same social choice criteria as other well-known Condorcet completion methods, but it has the advantage of being a natural social welfare function that provides a full ranking of the candidates. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_14015 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | BallotRank: A Condorcet Completion Method for Graphs Todd, Jason Douglas Volic, Ismar Computer Science and Game Theory General Economics Economics 91B12, 91B14 We introduce BallotRank, a ranked preference aggregation method derived from a modified PageRank algorithm. It is a Condorcet-consistent method without damping, and empirical examination of nearly 2,000 ranked choice elections and over 20,000 internet polls confirms that BallotRank always identifies the Condorcet winner at conventional values of the damping parameter. We also prove that the method satisfies many of the same social choice criteria as other well-known Condorcet completion methods, but it has the advantage of being a natural social welfare function that provides a full ranking of the candidates. |
| title | BallotRank: A Condorcet Completion Method for Graphs |
| topic | Computer Science and Game Theory General Economics Economics 91B12, 91B14 |
| url | https://arxiv.org/abs/2601.14015 |