Rendezvous search on the line

Operations Research

Volumn 47, Issue 6, 1999, Pages 974-976

  Gal, Shmuel ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; STRATEGIC PLANNING;

RENDEZVOUS SEARCH PROBLEM (RSP);

GAME THEORY;

EID: 0033345946     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.6.974     Document Type: Article

References (8)

1. Alpern, S. 1995. The rendezvous search problem. SIAM J. Control Optim. 33 673-683.
2. _, S. Gal. 1995. Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. 33 1270-1276.
3. Beck, A. 1965. More on the linear search problem. Israel J. Math. 3 61-70.
4. _, M. Beck. 1984. Son of the linear search problem. Israel J. Math. 48 109-122.
5. Gal, S. 1980. Search Games. Academic Press, New York.
6. Howard, J.V. 1996. Rendezvous search on the interval and the circle. Oper. Res., to appear.
7. Lim, W.S., S. Alpern. 1996. Minimax rendezvous on the line. SIAM J. Control Optim. 34 1650-1665.
8. Schelling, T.C. 1960. The Strategy of Conflict. Harvard University Press, Cambridge, MA.