MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Here is an introduction to nontransitive dice. The question is: given $n$-player with a $m$-sided dice each one, the what is the minimum of $m$ for a fixed $n$ to produce nontransitivity?

Here is some related posts:

What is the most extreme set 4 or 5 nontransitive n-sided dice?

What is the most unfair set of three nontransitive dice?

How far can probability intransitivity be stretched?

share|cite|improve this question
$m=3$ for $n=3$, for example, the three dices are {1,5,9}, {2,6,7},{3,4,8}. – Eden Harder Aug 23 '13 at 14:22
What is $n$? The number of dice? How nontransitive must they be? – Will Sawin Aug 23 '13 at 17:55
@WillSawin Yeah $n$ is the number of dice. – Eden Harder Aug 23 '13 at 23:45
What about the second question? There are many large nontransitive arrangements that are not nontransitive in an interesting way. For instance, take lots of small perturbations of your dice: $\{1.01,5.02,8.99\}$ and so on. This will give a large number of nontransitive dice for $m=3$. But this doesn't seem like the right case to consider. – Will Sawin Aug 24 '13 at 0:38
@WillSawin It is a cool idea! We can always to do this perturbation, but the nontransitivity is only related to the order of the numbers but not what they exactly are. – Eden Harder Aug 24 '13 at 0:54

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.