Conjecture on the optimal strategy for dependent Bernoulli variables
Conjecture on the optimal strategy for dependent Bernoulli variables
Let be dependent Bernoulli random variables, and let
Optimal-strategy conjecture. After observing , the player whose turn it is should give up his turn to his opponent if and only if for all . This predicts that the adversarial Last-Success-Problem remains simple for dependent variables, with the decision determined by the conditional success probabilities of the remaining variables. The conjecture is presented as a prediction in the source; no resolution is given.
Progress summary
No publicly sourced proof or counterexample has been found, so the conjecture remains open.
The conjecture says that after observing , a player should pass exactly when every later conditional success probability satisfies . It appears as Conjecture 1 in a paper on the adversarial Last-Success-Problem, which gives no proof or resolution.
Current status (as of August 2026): The conjecture remains unsettled; the retrieved public record contains its formulation but no verified proof, counterexample, or claimed resolution.
Sources
Sources & referencesView supporting material
Primary source
José María Grau Ribas, “Concerning an adversarial version of the Last-Success-Problem”, arXiv:1812.05381 (2019).
Solutions 1
Sign in to submit a solution.
The proposed rule fails in both directions, even for three Bernoulli variables with full joint support. Moreover, identical future conditional success probabilities can require opposite optimal decisions.
Take , let be an independent fair Bernoulli variable, and condition on . Write
If the current player retains the turn, optimal backward induction gives the winning probability
Indeed, on , the player cannot pass and wins exactly when , contributing . On , retaining wins on outcome , whereas passing wins on outcome , contributing the larger of and . Passing immediately after instead wins with probability .
First, take
Then
The conjecture therefore prescribes passing. But
so retaining wins with probability , while passing wins with probability .
Conversely, take
Here
so the conjecture prescribes retaining. Nevertheless,
and passing is strictly optimal, with winning probability .
Finally, taking
gives the same two conditional success probabilities as the first example, but now
so the optimal decision is the opposite. Thus even the complete list of future one-coordinate conditional success probabilities does not determine the optimal action. All eight joint outcomes of have strictly positive probability in every example.