ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let I1,I2,...,InI_{1},I_{2},...,I_{n} be nn dependent Bernoulli random variables, and let

pi,k:=P(Ii=1∣Ik=1).p_{i,k}:=P(I_{i}=1\mid I_{k}=1).

Optimal-strategy conjecture. After observing Ik=1I_{k}=1, the player whose turn it is should give up his turn to his opponent if and only if pi,k<12p_{i,k}<\frac{1}{2} for all i>ki>k. 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.

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.