Search games on a network with travelling and search costs
- 199 Downloads
The authors analyse two-person zero-sum search games in which play takes place on a network and in discrete time. The hider first chooses a node and remains there for the duration of the game. The searcher then chooses a node and searches there. At each subsequent time instant the searcher moves from the node he occupies to an adjacent node and decides whether or not to search it. Play terminates when the searcher is at the node chosen by the hider and searches there. The searcher incurs costs in moving from one node to another and also when a node is searched. The searcher wants to minimize the costs of finding the hider and the hider wants to maximize them. The paper has two main strands. The first investigates these games on directed, not necessarily strongly connected, networks; previous work has tended to concentrate on undirected networks. The second complements previous work on undirected networks by obtaining results for the case when the search cost is the same for all nodes.
KeywordsSearch game on a network Traveling and search costs Immobile hider
The authors are grateful to two anonymous reviewers and the Associate Editor for helpful comments and suggestions. This work was supported by JSPS KAKENHI Grant Number 23510177.
- Alpern S, Gal S (2003) The theory of search games and rendezvous., Kluwer international series in operations research and management sciencesKluwer, BostonGoogle Scholar
- Alpern S, Lidbetter T (2013) Searching a variable speed network, Math Oper Res. doi: 10.1287/moor.2013.0634
- Gal S (2013) Search games: a review, Search theory: a game theoretic perspective. Springer, New YorkGoogle Scholar
- Kikuta K (1995) A search game with travelling cost on a tree. J Oper Res Soc Jpn 38:70–88Google Scholar