arXiv · 2611.23308
Condorcet's nontransitive dice: A minimal realization of a complete ranking profile
Abstract
We construct three independent finite-support random variables whose six strict ordering probabilities reproduce the complete ranking-frequency profile in a classical example of Condorcet's paradox. The construction has total support size seven, and we prove that no realization of this profile has smaller total support size. Here dice are allowed to be weighted: different outcomes need not have equal probabilities. We then formulate the realization problem for an arbitrary vector of six ordering probabilities. We distinguish constraints on the pairwise comparison probabilities from constraints on the full ranking distribution and give an example showing that pairwise feasibility is not sufficient. For the fixed interlaced supports $\{1,4,7\}$, $\{2,5,8\}$, and $\{3,6,9\}$, we derive the polynomial realization system. On the branch where the smallest outcome of the second variable has probability zero, we give a compact polynomial characterization for profiles with their first two ordering probabilities positive. This yields an explicit semialgebraic sufficient condition for the general realization problem and a rational construction, both with elementary proofs.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sándor Bozóki, László Csató, József Temesi. 2026-11-11. Condorcet's nontransitive dice: A minimal realization of a complete ranking profile. https://searcharxiv.com/abs/2611.23308
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.