Metraipolis › archive › dc_ead54729eb22
A proof of Ross's conjecture for two-site moving-target search — arXiv:2608.09368
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09368
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:05:37.989Z
- SHA-256 of the archived text
99afaef263b755a6bab4ed2c304767cd9618b5df9e3149f93fe2e693ff90706a- Stable URL of this page
https://metraipolis.com/documento/dc_ead54729eb22
How to cite
A proof of Ross's conjecture for two-site moving-target search — arXiv:2608.09368 — arXiv (en), https://arxiv.org/abs/2608.09368 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ead54729eb22 (Metraipolis archive dc_ead54729eb22, sha256 99afaef263b755a6bab4ed2c304767cd9618b5df9e3149f93fe2e693ff90706a)
BibTeX
@misc{dcead54729eb22,
title = {A proof of Ross's conjecture for two-site moving-target search — arXiv:2608.09368},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09368},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ead54729eb22; sha256 99afaef263b755a6bab4ed2c304767cd9618b5df9e3149f93fe2e693ff90706a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09368. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A target moves between two sites according to a discrete-time Markov chain with a $2\times2$ transition matrix $M$. At each epoch one site is searched at positive cost, and a search may overlook a target that is present. Ross conjectured that an optimal policy is threshold in the posterior probability that the target is at site~1. MacPhee and Jordan proved the conjecture throughout the nonpositive-determinant ($\det M\le0$) regime and for part of the positive-determinant ($\det M>0$) regime, leaving the remaining cases open. We prove threshold optimality throughout the positive-determinant regime, completing Ross's conjecture for all parameter values. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.OC). Categorie arXiv: Probability (math.PR) ; Discrete Mathematics (cs.DM); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.09368 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T09:03:32.099Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).