The symmetric rendezvous-evasion game

SIAM Journal on Control and Optimization

Volumn 36, Issue 3, 1998, Pages 948-959

  Alpern, Steve ^a   Lim, Wei Shi ^b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Rendezvous search; Zero sum game

Indexed keywords

RANDOM PROCESSES;

RENDEZVOUS EVASION GAME; ZERO SUM GAME;

GAME THEORY;

EID: 0032070364     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012996309770     Document Type: Article

References (10)

1. S. ALPERN, The rendezvous search problem, SIAM J. Control Optim., 33 (1995), pp. 673-683.
2. S. ALPERN, Games with repeated decisions, J. Control Optim., 26 (1988), pp. 468-477.
3. E. J. ANDERSON AND R. R. WEBER, The rendezvous problem on discrete locations, J. Appl. Probab., 28 (1990), pp. 839-851.
4. S. GAL, Search Games, Academic Press, New York, 1980.
5. J. ISBELL, Finitary games, in Contributions to the Theory of Games III, Princeton University Press, Princeton, NJ, 1957.
6. W. S. LIM, Rendezvous-evasion games on discrete locations, with joint randomization, Adv. in Appl. Probab., 29 (1997), pp. 1004-1017.
7. W. S. LIM, S. ALPERN, AND A. BECK, Rendezvous search on the line with more than two players, Oper. Res., 45 (1997), pp. 357-364.
8. T. NAKAI, A search game with one object and two searchers, J. Appl. Probab., 23 (1986), pp. 696-707.
9. M. PICCIONE AND A. RUBINSTEIN, On the interpretation of decision problems with imperfect recall, Working paper 9-94, Sackler Institute, Tel Aviv University, 1994.
10. W. H. RUCKLE, Geometric Games and Their Applications, Pitman, Boston, MA, 1983.