What does No Perfect Arbiter conclude, in numbers, about “The Exact Probability of a Condorcet Cycle: 216 Profiles, Panel Size and the Number of Options”?
Answer: Chapter 2 computes the exact probability of a Condorcet cycle: 0.0556 for three reviewers, rising towards 0.0877 as the panel grows, and rising fast as options are added.
Scope of the numbers: Reviewer names and parameters are illustrative, all calculations are generated by the book's programs, and the book is general business analysis, not business advice. Chapter 6 builds a scenario of conflicting kit refusal codes with illustrative rule names, computes deadlock risks and recommends a hybrid rule that vetoes first and then compares grades in written priority order.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.0556, 0.0877
| n | P(no Condorcet winner) | exact fraction |
|---|---|---|
| 3 | 0.0556 | 1/18 |
| 5 | 0.0694 | 5/72 |
| 7 | 0.0750 | 875/11664 |
| 9 | 0.0780 | 65485/839808 |
| 11 | 0.0798 | 134057/1679616 |
| 13 | 0.0811 | 4901897/60466176 |
| 15 | 0.0820 | 89225851/1088391168 |
| 17 | 0.0827 | 1439664941/17414258688 |
| 19 | 0.0832 | 2112831602453/25389989167104 |
| 21 | 0.0837 | 76462477749515/914039610015744 |
| 23 | 0.0840 | 153584540033093/1828079220031488 |
| 25 | 0.0843 | 99880830340054985/1184595334580404224 |
| limit n -> infinity: 0.0877 |
Show the full program
# Chapter 2. p22: exact cycle probability as the panel grows (3 options).
# Impartial culture with n reviewers (n odd). A profile is summarised
# by how many reviewers hold each of the 6 rankings; its probability is
# the multinomial n! / (k1! k2! k3! k4! k5! k6!) / 6 ** n. We enumerate every
# composition of n into 6 parts and add the weight of those with no
# Condorcet winner. Integer weights, exact Fraction result.
# Limit as n grows (Guilbaud 1952, as reported by Gehrlein 2002):
# 1/4 - (3 / (2 pi)) asin(1/3)
import itertools
import math
from fractions import Fraction
OPTS = "ABC"
ORDERS = ["".join(p) for p in itertools.permutations(OPTS)]
def compositions(n, k):
for cut in itertools.combinations(range(n + k - 1), k - 1):
prev = -1
parts = []
for c in cut:
parts.append(c - prev - 1)
prev = c
parts.append(n + k - 1 - prev - 1)
yield parts
PREF = {(x, y): [o.index(x) < o.index(y) for o in ORDERS]
for x in OPTS for y in OPTS if x != y}
def no_winner(counts, n):
for x in OPTS:
ok = True
for y in OPTS:
if y == x:
continue
k = 0
for c, f in zip(counts, PREF[(x, y)]):
if f:
k += c
if 2 * k <= n:
ok = False
break
if ok:
return False
return True
def p_cycle(n):
bad = 0
fn = math.factorial(n)
for parts in compositions(n, 6):
if no_winner(parts, n):
w = fn
for c in parts:
w //= math.factorial(c)
bad += w
return Fraction(bad, 6 ** n)
if __name__ == "__main__":
print(" n P(no Condorcet winner) exact fraction")
for n in range(3, 26, 2):
p = p_cycle(n)
fr = str(p)
if len(fr) > 40:
fr = "(long fraction)"
print(" {:>2} {:.4f} {}".format(n, float(p), fr))
lim = 0.25 - 1.5 / math.pi * math.asin(1 / 3)
print("limit n -> infinity: {:.4f}".format(lim))Single source and citation
Fan, Y. (2026). Arrow's Impossibility Theorem and the Aggregation of Multiple Reviewers: Why No Perfect Arbiter Exists When Kit Refusal Codes Conflict (Version 1.0.0), Chapter 2: The Exact Probability of a Condorcet Cycle: 216 Profiles, Panel Size and the Number of Options. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-310 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026310,
author = {Fan, Yafu},
title = {Arrow's Impossibility Theorem and the Aggregation of Multiple Reviewers: Why No Perfect Arbiter Exists When Kit Refusal Codes Conflict},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Four Axioms and an Empty Table: Arrow's Theorem Enumerated for Three Reviewers and Three Options
- Chapter 3 · The Borda Count and Irrelevant Options: Twenty-One Electors, Decoys and Spoilers
- Chapter 4 · Single-Peaked Preferences and Value Restriction: When Cycles Disappear
- Chapter 5 · The Lexicographic Priority Arbiter: Which Axiom It Gives Up and What It Buys
- Chapter 6 · Conflicting Kit Refusal Codes: an Illustrative Scenario, Deadlock Risk and the Priority Order
- Chapter 7 · Eastern and Western Sources Examined: First Grader, Review Grader and Arbiter in the Song History, and Borda's Equal Steps
- Chapter 8 · Closing the Loop: Turning Multi-Reviewer Verdicts in the Kits into an Explicit Priority, with a Pre-Registered Plan of Refutation