# The Probability of Intransitivity in Dice and Close Elections

@article{Hkazla2018ThePO, title={The Probability of Intransitivity in Dice and Close Elections}, author={Jan Hkazla and Elchanan Mossel and Nathan Ross and Guangqu Zheng}, journal={arXiv: Probability}, year={2018} }

Intransitivity often emerges when ranking three or more alternatives. Condorcet paradox and Arrow's theorem are key examples of this phenomena in the social sciences, and non-transitive dice are a fascinating aspect of games of chance. In this paper, we study intransitivity in natural random models of dice and voting. First, we follow a recent thread of research that aims to understand intransitivity for three or more $n$-sided dice (with non-standard labelings), where the pairwise ordering is… Expand

#### Tables from this paper

#### 2 Citations

#### References

SHOWING 1-10 OF 48 REFERENCES

A mathematical solution for the probability of the paradox of voting.

- Mathematics, Medicine
- Behavioral science
- 1968

Condorcet's paradox and the likelihood of its occurrence: different perspectives on balanced preferences*

- Mathematics
- 2002

A tight quantitative version of Arrow's impossibility theorem

- Mathematics, Computer Science
- ArXiv
- 2010

A quantitative Gibbard-Satterthwaite theorem without neutrality

- Mathematics, Computer Science
- Comb.
- 2015

The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem

- Mathematics, Computer Science
- 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010