The Paradox of Nontransitive Dice

DOI10.2307/2974903zbMath0808.05011OpenAlexW4255295244MaRDI QIDQ4305676

Richard P. Jun. Savage

Publication date: 9 March 1995

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2974903

zbMATH Keywords

upper boundprobabilityFibonacci number

Mathematics Subject Classification ID

Combinatorial probability (60C05) Enumerative combinatorics (05A99)

Related Items (20)

Partial order on a family of \(k\)-subsets of a linearly ordered set ⋮ A necessary 4-cycle condition for dice representability of reciprocal relations ⋮ The Bizarre World of Nontransitive Dice: Games for Two or More Players ⋮ Balanced Nontransitive Dice ⋮ Using a SAT Solver to Find Interesting Sets of Nonstandard Dice ⋮ Ranking graphs through hitting times of Markov chains ⋮ Balanced nontransitive dice: existence and probability ⋮ A Game of Nontransitive Dice ⋮ Construction of aggregation paradoxes through load-sharing models ⋮ An upper bound for a cyclic sum of probabilities ⋮ Strongly connectable digraphs and non-transitive dice ⋮ Stochastic precedence and minima among dependent variables ⋮ Properties of sets of nontransitive dice with few sides ⋮ On the likelihood of cyclic comparisons ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ On some ordinal models for decision making under uncertainty ⋮ The nontransitivity problem for three continuous random variables ⋮ Efron's coins and the linial arrangement ⋮ Nontransitive Random Variables and Nontransitive Dice ⋮ Independent random utility representations

This page was built for publication: The Paradox of Nontransitive Dice