Asymptotically minimax stochastic search strategies in the plane

DOI10.1073/pnas.84.8.2111zbMath0613.90108OpenAlexW2047720007WikidataQ34611202 ScholiaQ34611202MaRDI QIDQ4721889

Herbert Robbins, Steven P. Lalley

Publication date: 1987

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.84.8.2111

zbMATH Keywords

semi-Markov processesfirst-passage timesmobile targetprincess and monster gameStochastic search strategies

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Dynamic programming (90C39) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

Billiards in a general domain with random reflections ⋮ Stochastic search in a convex region

This page was built for publication: Asymptotically minimax stochastic search strategies in the plane