Pure strategy asymmetric rendezvous on the line with an unknown initial distance

Operations Research

Volumn 48, Issue 3, 2000, Pages 498-501

  Alpern, S ^a   Beck, A ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; NUMERICAL METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

ASYMMETRIC RENDEZVOUS SEARCH PROBLEM ON THE LINE; DOUBLE LINEAR SEARCH PROBLEM;

GAME THEORY;

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

References (14)

1. The rendezvous search problem
2. Asymmetric rendezvous on the line is a double linear search problem
3. Rendezvous search on the line with distinguishable players
4. Rendezvous search on the line with indistinguishable players
5. Two rendezvous search problems on the line
6. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution
7. Rendezvous search on the line
8. On the optimality of the exponential functions for some minimax problems
9. Rendezvous search on the interval and the circle
10. The conservation of Spix's macaw
11. Minimax rendezvous on the line
12. Minimax triple rendezvous on the line: Corrections and extensions
13. Rendezvous search on the line with more than two players