ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let β1,β2,…\beta_1,\beta_2,\ldots be independent Bernoulli random variables with success probability pp, let t≥pt\geq p, and let γ=(ci)\gamma=(c_i) be a non-increasing sequence of non-negative reals with ∑ici=1\sum_i c_i=1. Define

Sγ=∑iciβi,S_\gamma=\sum_i c_i\beta_i,

and

π(p,t)=sup⁡γP(Sγ≥t).\pi(p,t)=\sup_\gamma \mathbf P(S_\gamma\geq t).

Csóka's conjecture. For every pp and tt there exists a k∈Nk\in\mathbb N such that π(p,t)\pi(p,t) is realized by ci=1kc_i=\frac1k for i≤ki\leq k and ci=0c_i=0 for i>ki>k; 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 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.