A Nonzero-Sum Search Game with Two Competitive Searchers and a Target
Ryusuke Hohzaki · Birkhäuser Boston eBooks · 2012
In this paper, we deal with a nonzero-sum three-person noncooperative search game, where two searchers compete for detection of a target and the target tries to evade the searchers. We verify that there occurs cooperation between two searchers against the target in the game with a stationary target and for a special case of the game with a moving target. Using these characteristics, we can partially regard the three-person nonzero-sum game as an equivalent two-person zero-sum game with the detection probability of target as a payoff. For a general game with a moving target, however, there could be many Nash equilibria. We propose a numerical algorithm for a Nash equilibrium in the general case. The discussion on the nonzero-sum search game in this paper could help us to step forward to a cooperative search game, where a coalition of some searchers and the rest of searchers compete against each other for detection of target as the future work.