Charles Leedham-Green
Datos Biográficos
| ID | 6219082 |
|---|---|
| NOMBRE | Charles Leedham-Green |
| NOMBRES | Charles |
| APELLIDO | Leedham-Green |
| FIRMA | LEEDHAM-GREEN C |
| VERIFICADO | No |
| TOTAL DE OBRAS | 2 |
| TOTAL DE CITAS | 0 |
| OBRAS COMO AUTOR | 2 |
| OBRAS COMO EDITOR | 0 |
| PRIMER AÑO DE PUBLICACIÓN | 2024 |
| AÑO MÁS RECIENTE DE PUBLICACIÓN | 2025 |
| ÍNDICE H | 0 |
Condorcet domains on at most seven alternatives
A Condorcet domain is a collection of linear orders which avoid Condorcet's paradox for majority voting. We have developed a new algorithm for complete enumeration of all maximal Condorcet domains and, using a supercomputer, obtained the first enumeration of all maximal Condorcet domains on n≤7 alternatives. We investigate properties of these domains and use this study to resolve several open questions regarding Condorcet domains, and propose sev…
The largest Condorcet domain on 8 alternatives
In this note, we report on a Condorcet domain of record-breaking size for n = 8 alternatives. We show that there exists a Condorcet domain of size 224 and that this is the largest possible size for 8 alternatives. Our search also shows that this domain is unique up to isomorphism. In this note we investigate properties of the new domain and relate them to various open problems and conjectures
Sin obras prominentes en esta página.
The largest Condorcet domain on 8 alternatives
In this note, we report on a Condorcet domain of record-breaking size for n = 8 alternatives. We show that there exists a Condorcet domain of size 224 and that this is the largest possible size for 8 alternatives. Our search also shows that this domain is unique up to isomorphism. In this note we investigate properties of the new domain and relate them to various open problems and conjectures
Condorcet domains on at most seven alternatives
A Condorcet domain is a collection of linear orders which avoid Condorcet's paradox for majority voting. We have developed a new algorithm for complete enumeration of all maximal Condorcet domains and, using a supercomputer, obtained the first enumeration of all maximal Condorcet domains on n≤7 alternatives. We investigate properties of these domains and use this study to resolve several open questions regarding Condorcet domains, and propose sev…
Condorcet method (2 obras) · Game Theory and Voting Systems (2 obras) · Logic, Reasoning, and Knowledge (2 obras) · Mathematical economics (2 obras) · Mathematics (2 obras) · Political science (2 obras) · Voting (2 obras) · Complexity and Algorithms in Graphs (1 obra) · Computer Science (1 obra) · Econometrics (1 obra)