Asymmetric Rendezvous on the Line Is a Double Linear Search Problem

DOI10.1287/moor.24.3.604zbMath0944.90032OpenAlexW2132239960MaRDI QIDQ4951040

Anatole Beck, Steven Alpern

Publication date: 26 September 2000

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.24.3.604

zbMATH Keywords

rendezvoussearch game

Mathematics Subject Classification ID

Search theory (90B40) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (6)

Rendezvous search on labeled networks ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ Ten Open Problems in Rendezvous Search ⋮ Line-of-sight rendezvous ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Searching a Variable Speed Network

This page was built for publication: Asymmetric Rendezvous on the Line Is a Double Linear Search Problem