Abstract

We consider nn-sided dice whose face values lie between 11 and nn and whose faces sum to n(n+1)/2n(n+1)/2. For two dice AA and BB, define A≻BA \succ B if it is more likely for AA to show a higher face than BB. Suppose kk such dice A1,…,AkA_1,\dots,A_k are randomly selected. We conjecture that the probability of ties goes to 0 as nn grows. We conjecture and provide some supporting evidence that---contrary to intuition---each of the 2(k2)2^{k \choose 2} assignments of ≻\succ or ≺\prec to each pair is equally likely asymptotically. For a specific example, suppose we randomly select kk dice A1,…,AkA_1,\dots,A_k and observe that A1≻A2≻…≻AkA_1 \succ A_2 \succ \ldots \succ A_k. Then our conjecture asserts that the outcomes Ak≻A1A_k \succ A_1 and A1≺AkA_1 \prec A_k both have probability approaching 1/21/2 as n→∞n \rightarrow \infty.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.