The Surprisingly Simple Math Behind Puzzling Matchups | Quanta Magazine
intransitivitycombinatoricsgame-theoryprobabilitymathematics
Abstraction: Intransitive dice show winning relationships can cycle non-transitively
Key points:
- "Being favored against" is not a transitive relation: three-sided coins A, B, C each beat the next 5/9 of the time (55%), yet C beats A 5/9 — a cycle with no best option
- In two-sided coin games intransitivity is mathematically impossible to construct (provable: the player with the lowest number is always the underdog)
- Intransitivity arises from matchup-specific advantages, analogous to sports upsets where team styles create non-transitive win relationships
- Polymath project (2022 arXiv paper 2211.16156) advanced understanding of intransitive dice after 50+ years of study
- Intransitivity has practical implications for team rankings, voting systems (Arrow's paradox), and consumer preferences
- The example illustrates why transitivity cannot be assumed whenever comparing multi-attribute alternatives
Connections: Polymath Project · Intransitive Dice · Probability Theory · Combinatorics
Source: https://www.quantamagazine.org/the-surprisingly-simple-math-behind-puzzling-matchups-20240125/