ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (A,B,C)(A,B,C) be a balanced non-transitive set of nn-sided dice, with equal cyclic winning probabilities, and suppose that P(A>B)>12P(A>B)>\frac{1}{2}.

Probability upper-bound conjecture. Then

12<P(A>B)<12+19.\frac{1}{2}<P(A>B)<\frac{1}{2}+\frac{1}{9}.

The conjecture proposes a universal upper bound for the winning probability of a balanced non-transitive set. The paper verifies it for some constructions, but the supplied text gives no general resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.