Winning Probabilities of Balanced and Nontransitive n-tuples of Dice
Joshua Rooney

TL;DR
This paper characterizes the range of winning probabilities for balanced, nontransitive n-tuples of dice, showing that any rational probability within a specific interval can be achieved, thus fully solving a longstanding problem.
Contribution
It proves that all rational winning probabilities within the established bounds are attainable for balanced, nontransitive dice, completing the characterization of their probability spectrum.
Findings
Winning probability less than for n=3
Extension of bounds to n for all n
Existence of balanced, nontransitive dice for all rational probabilities in the interval
Abstract
For a positive integer , an -tuple of dice is called balanced if and nontransitive if are each greater than . For a balanced and nontransitive -tuple of dice , we define the winning probability . The works of Trybula and Kim et al. together show that for a balanced and nontransitve triple of dice , the least upper bound on the winning probability is . Kim et al. then asked what the least upper bound on the winning probability was for the cases. Bogdanov and Komisarski independently have shown that for and a balanced and nontransitive -tuple of dice , the winning probability is less than $\pi_n :=…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Analytic Number Theory Research · graph theory and CDMA systems
