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 alte...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical social sciences 2025-01, Vol.133, p.23-33
Main Authors: Akello-Egwel, Dolica, Leedham-Green, Charles, Litterick, Alastair, Markström, Klas, Riis, Søren
Format: Article
Language:English
Subjects:
Condorcet domains
Social choice
Voting theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 several new conjectures. Following this we connect our results to other domain types used in voting theory, such a non-dictatorial and strategy-proof domains. All our data are made freely available on the web.
ISSN:0165-4896
1879-3118
DOI:10.1016/j.mathsocsci.2024.12.002