A Generalization of the Multi-Stage Search Allocation Game
This chapter deals with a multistage two-person zero-sum game called multistage search allocation game (MSSAG), in which a searcher and a target participate. The searcher distributes his searching resource in a search space to detect the target and the target moves under an energy constraint to evade the searcher. At the beginning of each stage, the searcher is informed of the target’s position and of his moving energy, and the target knows the amount of the searcher’s resource used so far. The game ends when the searcher detects the target. The payoff of the game is the probability of detecting the target during the search. There have been few search games on the MSSAG. We started the discussion on the MSSAG in a previous paper, where we assumed an exponential function for the detection probability of the target. In this chapter, we introduce a general function for the detection probability, aiming at more applicability. We first formulate the problem as a dynamic program. Then, by convex analysis, we propose a general method to solve the problem, and elucidate some general properties of optimal solutions.
KeywordsEquilibrium Point Optimal Strategy Detection Probability Residual Energy Stochastic Game
Unable to display preview. Download preview PDF.
- 12.Hohzaki, R., Iida, K.: A solution for a two-person zero-sum game with a concave payoff function. In: Takahashi, W., Tanaka, T. (eds.) Nonlinear Analysis and Convex Analysis, pp. 157–166. World Science Publishing, London (1999)Google Scholar
- 17.Koopman, B.O.: Search and Screening. pp. 221–227. Pergamon, (1980)Google Scholar
- 18.Meinardi, J.J.: A sequentially compounded search game. In: Theory of Games: Techniquea and Applications, pp. 285–299. The English Universities Press, London (1964)Google Scholar
- 21.Owen, G.: Game Theory. Academic, N.Y. (1995)Google Scholar
- 24.Stone, L.D.: Theory of Optimal Search. pp. 136–178. Academic, N.Y. (1975)Google Scholar
- 26.Washburn, A.R., Hohzaki, R.: The diesel submarine flaming datum problem. Military Operations Research 6, 19–33 (2001)Google Scholar