Searching for an agent who may or may not want to be found

Operations Research

Volumn 50, Issue 2, 2002, Pages 311-323

  Alpern, Steve ^a   Gal, Shmuel ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; TARGETS; THEOREM PROVING;

SEARCH PROBLEMS;

GAME THEORY;

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

References (23)

1. The search game with mobile hider on the circle
2. The rendezvous search problem
3. A mixed strategy minimax theorem without compactness
4. Rendezvous search on the line with distinguishable players
5. Rendezvous search on the line with indistinguishable players
6. Two-dimensional rendezvous search
7. The rendezvous problem on discrete locations
8. Two rendezvous search problems on the line
9. Generalizations in the linear search problem
10. On the linear search problem
11. Rendezvous search on the line
12. Rendezvous search on the interval and the circle
13. A search game with traveling cost on a tree
14. A rendezvous-evasion game on discrete locations with joint randomization
15. Search games with immobile hider
16. Searching for targets who want to be found
17. Optimal search for a randomly moving object
18. On a differential game with incomplete information