The probability upper-bound conjecture for balanced non-transitive dice
Statement
Let be a balanced non-transitive set of -sided dice, with equal cyclic winning probabilities, and suppose that .
Probability upper-bound conjecture. Then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.