This project introduced a new network search game with consideration given to the weights at different locations.
Most search game models assume that the hiding locations are identical, and the players’ objective is to optimize the search time; however, there are some cases in which the players may differentiate the hiding locations from each other, and the objective is to optimize a weighted search time. In addition, the search may involve multiple search teams. In the proposed network search game, a hider can hide multiple objects and there may be multiple search teams. For a special case of the problem, this project proved that the game has a closed-form Nash equilibrium. For the general case, the project developed an algorithm based on column and row generation. It showed that the Searcher’s subproblem is NP-hard and proposed a branch and price algorithm to solve it. The project also presents a polynomial time algorithm for the Hider’s subproblem. Numerical experiments demonstrate the efficiency of the proposed algorithms and reveal insights into the properties of this game. (publisher abstract modified)
810 Seventh Street NW, Washington, DC 20531, United States
See NCJ 304123 for author corrections and clarification.