Network search games, with arbitrary searcher starting point

Network search games, with arbitrary searcher starting point

0.00 Avg rating0 Votes
Article ID: iaor200969355
Country: United States
Volume: 52
Issue: 3
Start Page Number: 156
End Page Number: 161
Publication Date: Oct 2008
Journal: Networks
Authors: ,
Keywords: game theory
Abstract:

We analyze a zero-sum game between a blind unit-speed searcher and a stationary hider on a given network Q, where the payoff is the time for the searcher to reach the hider. In contrast to the standard game studied in the literature, we do not assume that the searcher has to start from a fixed point (known to the hider) but can choose his starting point. We show that for some networks, including trees, the optimal searcher, and hider strategies have a simple structure.

Reviews

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