Condorcet Candidate

In voting theory, a Condorcet candidate is a candidate who always wins in a 2-person election but loses in larger election. For example, consider the 6-tuples of 6-sided die rolls A=(1,1,1,4,7,7), B=(2,2,5,5,5,5), and C=(3,3,3,3,3,6).

Represent a two-person election by considering all 36 outcomes for rolling these two dice. Then B beats A 22 to 14, and beats C 20 to 16. In a three way election, A wins with 82, B is second with 80, and C is last with 54.

See also

Condorcet's Jury Theorem, Efron's Dice, Voting Paradoxes

This entry contributed by Ed Pegg, Jr. (author's link)

Explore with Wolfram|Alpha


Brams, S. J. and Taylor, A. D. Fair Division: From Cake-Cutting to Dispute Resolution. New York: Cambridge University Press, p. 208, 1996.

Referenced on Wolfram|Alpha

Condorcet Candidate

Cite this as:

Pegg, Ed Jr. "Condorcet Candidate." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein.

Subject classifications