Rendezvous search on labeled networks

Rendezvous search on labeled networks

0.00 Avg rating0 Votes
Article ID: iaor2003222
Country: United States
Volume: 49
Issue: 3
Start Page Number: 256
End Page Number: 274
Publication Date: Apr 2002
Journal: Naval Research Logistics
Authors:
Keywords: game theory
Abstract:

Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J.V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy.

Reviews

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