Csóka's averaging conjecture for convex combinations of Bernoulli variables
Statement
Let be independent Bernoulli random variables with success probability , let , and let be a non-increasing sequence of non-negative reals with . Define
and
Csóka's conjecture. For every and there exists a such that is realized by for and for ; equivalently, the maximal probability is realized by an average.
The conjecture asks whether equal staking always maximizes the upper-tail probability when the threshold is at least the Bernoulli success probability. The paper proves it for a range of parameter values, but the general assertion remains open.
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.