ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every stochastic transition matrix M=(mij)i,j∈{1,2}M=(m_{ij})_{i,j\in\{1,2\}}, every α1,α2∈[0,1)\alpha_1,\alpha_2\in[0,1), and every C1,C2>0C_1,C_2>0, the two-site moving-target search problem has an optimal deterministic stationary threshold selector. Thus, for some p∗∈[0,1]p^*\in[0,1], site 2 is selected when p<p∗p<p^* and site 1 is selected when p>p∗p>p^*; at p=p∗p=p^* either minimizing action may be selected. If an interval of beliefs consists entirely of ties, the threshold may be placed anywhere in that interval with ties resolved monotonically.

Record

Added
Links

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.