Manhunting — A Simple Search Game
We consider a search game in which a hider chooses to hide in any one of many cells. A searcher looks in any of the cells. The probability of finding the hider depends (a) on the characteristics of the cell, and (b) on whether the searcher looks in the right cell. It is possible that the hider may be found even if the searcher looks in the wrong cell. In one variant, the searcher wishes to maximize the probability of capture; in the other, the searcher wishes to minimize the expected time to capture. We show that the game can be solved by an easy algorithm, which allows for the manual solution of games with (of the order of) one hundred cells in a relatively short time. Some examples are given.
Volume (Year): 12 (2010)
Issue (Month): 04 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:12:y:2010:i:04:p:293-308. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.