A rendezvous-evasion game on discrete locations with joint randomization

Advances in Applied Probability

Volumn 29, Issue 4, 1997, Pages 1004-1017

  Lim, Wei Shi ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Rendezvous; Search; Zero sum game

Indexed keywords

PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

ZERO SUM GAME;

GAME THEORY;

EID: 0031388768     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0001867800047996     Document Type: Article

References (13)

1. ALPERN, S. (1995) The rendezvous search problem. SIAM J. Control Optim. 33, 673-683.
2. ALPERN, S. AND ASIC, M. (1985) The search value of a network. Networks 15, 229-238.
3. ALPERN, S. AND ASIC, M. (1986) Ambush strategies in search games on graphs. SIAM J. Control Optim. 24, 66-75.
4. ALPERN, S. AND BECK, A. (1997) Rendezvous search on the line with bounded resources. Europ. J. Operat. Res. (in press).
5. ALPERN, S. AND GAL, S. (1995) Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. 33, 1270-1276.
6. ANDERSON, E. J. AND ESSEGAIER, S. (1995) Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. 33, 1637-1642.
7. ANDERSON, E. J. AND WEBER, R. R. (1990) The rendezvous problem on discrete locations. J. Appl. Prob. 28, 839-851.
8. GAL, S. (1960) Search Games. Academic Press, New York.
9. GAL, S. AND ANDERSON, E. J. (1990) Search in a maze. Prob. Eng. Inf. Sci. 4, 311-318.
10. ISAACS, R. (1965) Differential Games. Wiley, New York.
11. LIM, W. S. (1996) Rendezvous-evasion as a multi-stage game with observed actions. LSE CDAM-Research Report Series 96-05.
12. LIM, W. S., BECK, A. AND ALPERN, S. (1997) Rendezvous search on the line with more than two players. Operat Res. 45, 357-364.
13. RUCKLE, W. H. (1983) Pursuit on a cyclic graph. Int. J. Game Theory 10, 91-99.