A common notion of clockwise can help in planar rendezvous

DOI10.1016/j.ejor.2005.03.050zbMath1142.90414OpenAlexW2065360856MaRDI QIDQ2433433

Vic Baston, Steven Alpern

Publication date: 27 October 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.050

zbMATH Keywords

game theorygroup decisions and negotiationssearch theory

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Other game-theoretic models (91A40)

Related Items

Line-of-sight rendezvous, Two point one sided rendezvous

Cites Work

• The theory of search games and rendezvous.
• Rendezvous Search on the Interval and the Circle
• Rendezvous in Higher Dimensions
• Two Dimensional Rendezvous Search
• Rendezvous Search: A Personal Perspective
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Note: Two rendezvous search problems on the line
• Searching for targets who want to be found
• A rendezvous-evasion game on discrete locations with joint randomization
• Rendezvous search on labeled networks
• Rendezvous Search on the Line
• The Rendezvous Search Problem
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with Indistinguishable Players
• Rendezvous on a Planar Lattice