Rendezvous search when marks are left at the starting points

Naval Research Logistics

Volumn 48, Issue 8, 2001, Pages 722-731

  Baston, Vic ^a   Gal, Shmuel ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Rendezvous; Search game; Search on the line

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

RENDEZVOUS SEARCH; RENDEZVOUS VALUE; SEARCH GAME;

LOGISTICS;

EID: 0035577684     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.1044     Document Type: Article

References (13)

1. The rendezvous search problem
2. Pure strategy asymmetric rendezvous search on the line with an unknown initial distance
3. The rendezvous search problem on the line with distinguishable players
4. Rendezvous search on the line with distinguishable players
5. Two dimensional rendezvous search
6. The rendezvous problem on discrete locations
7. Two rendezvous search problems on the line
8. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution
9. Yet more on the linear search problem
10. Learning how to cooperate: Optimal play in repeated coordination games
11. Search games
12. Rendezvous search on the line and circle
13. Dynamic focal points in N-person coordination games