Two-sided Search Game Based on Discrete Model
Zheng Yingping · Keji daobao · 2007
A two-sided search,where the target makes every effort to evade searchers' detection,can be regarded as a two-person zero-sum game.The game is formulated with consideration of search costs on both players and detection probabilities of cells.Based on a discrete model,a solution to this two-sided search game is proposed.The equilibrium of both players is analyzed after the simulation.