TOPICS
Search

Nontransitive Dice


Nontransitive dice are dice for which the comparison "more likely to roll a larger number" contains a directed graph cycle. Write A≻B when the rolled values of A and B are independent random variables satisfying P(A>B)>P(B>A). When ties are impossible, this is equivalent to P(A>B)>1/2. It also describes the advantage when tied rolls are independently repeated. There can be dice A, B, and C with A≻B, B≻C, and C≻A, so this relation need not be transitive (Gardner 1974, pp. 121-122).

For example, take three six-sided fair dice whose face labels are

A=(1,1,6,6,8,8)
(1)
B=(3,3,5,5,7,7)
(2)
C=(2,2,4,4,9,9).
(3)

Each die has three equally likely values. Counting the nine equally likely pairs of values gives P(A>B)=P(B>C)=P(C>A)=5/9. Thus each die is more likely to beat one rival and lose to another, despite each die being individually fair. This is the dice form of Gardner's three-packet card example (Gardner 1974, p. 122). Efron's dice provide a four-die construction.


See also

Dice, Efron's Dice, Transitive

Explore with Wolfram|Alpha

References

Gardner, M. "Mathematical Games: On the Paradoxical Situations That Arise from Nontransitive Relations." Sci. Amer. 231, 120-125, 1974. https://doi.org/10.1038/scientificamerican1074-120.Numberphile. "The Most Powerful Dice." Sep. 20, 2016. https://www.youtube.com/watch?v=zzKGnuvX6IQ.

Cite this as:

Weisstein, Eric W. "Nontransitive Dice." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/NontransitiveDice.html

Subject classifications