Rendezvous search when marks are left at the starting points

Rendezvous search when marks are left at the starting points

0.00 Avg rating0 Votes
Article ID: iaor2003218
Country: United States
Volume: 48
Issue: 8
Start Page Number: 722
End Page Number: 731
Publication Date: Dec 2001
Journal: Naval Research Logistics
Authors: ,
Keywords: game theory
Abstract:

Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution.

Reviews

Required fields are marked *. Your email address will not be published.