Ross’s conjecture
Statement
For every stochastic transition matrix , every , and every , the two-site moving-target search problem has an optimal deterministic stationary threshold selector. Thus, for some , site 2 is selected when and site 1 is selected when ; at 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
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.