Condorcet Domains, Median Graphs and the Single Crossing Property
Clemens Puppe, Arkadii Slinko

TL;DR
This paper explores the mathematical structure of Condorcet domains, showing their connection to median graphs and the single crossing property, and characterizes maximal domains and strategy-proof social choice functions.
Contribution
It establishes a novel correspondence between closed Condorcet domains and median graphs, and characterizes single crossing and maximal domains within this framework.
Findings
Closed Condorcet domains are naturally median graphs.
Single crossing domains correspond to linear graphs (chains).
Maximal Condorcet domains are induced only by chains among trees.
Abstract
Condorcet domains are sets of linear orders with the property that, whenever the preferences of all voters belong to this set, the majority relation has no cycles. We observe that, without loss of generality, such domain can be assumed to be closed in the sense that it contains the majority relation of every profile with an odd number of individuals whose preferences belong to this domain. We show that every closed Condorcet domain is naturally endowed with the structure of a median graph and that, conversely, every median graph is associated with a closed Condorcet domain (which may not be a unique one). The subclass of those Condorcet domains that correspond to linear graphs (chains) are exactly the preference domains with the classical single crossing property. As a corollary, we obtain that the domains with the so-called `representative voter property' (with the exception of a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
