Majority relations for Condorcet domains of tiling type
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914053707792384 |
|---|---|
| author | Reiner, Victor Tenner, Bridget Eileen |
| author_facet | Reiner, Victor Tenner, Bridget Eileen |
| contents | Condorcet domains are subsets of permutations arising in voting theory: regarding their permutations as preference orders on a list of candidates, one avoids Condorcet's paradox when aggregating the preferences via a simple majority relation. We use poset theory to show that, for the subclass of Condorcet domains of tiling type, the majority rule has stronger properties. We then develop techniques to predict the majority rule explicitly for the uniform vote tally on Condorcet domains of tiling type, and apply this to several well-known examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_19614 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Majority relations for Condorcet domains of tiling type Reiner, Victor Tenner, Bridget Eileen Combinatorics 05A05, 06A07, 91B12 Condorcet domains are subsets of permutations arising in voting theory: regarding their permutations as preference orders on a list of candidates, one avoids Condorcet's paradox when aggregating the preferences via a simple majority relation. We use poset theory to show that, for the subclass of Condorcet domains of tiling type, the majority rule has stronger properties. We then develop techniques to predict the majority rule explicitly for the uniform vote tally on Condorcet domains of tiling type, and apply this to several well-known examples. |
| title | Majority relations for Condorcet domains of tiling type |
| topic | Combinatorics 05A05, 06A07, 91B12 |
| url | https://arxiv.org/abs/2509.19614 |