Print Email Facebook Twitter On search games that include ambush Title On search games that include ambush Author Alpern, S. Fokkink, R. Gal, S. Timmer, M. Faculty Electrical Engineering, Mathematics and Computer Science Department Delft Institute of Applied Mathematics Date 2013-12-19 Abstract We present a stochastic game that models ambush/search in a finite region Q which has area but no other structure. The searcher can search a unit area of Q in unit time or adopt an "ambush" mode for a certain period. The searcher "captures" the hider when the searched region contains the hider's location or if the hider moves while the searcher is in ambush mode. The payoff in this zero sum game is the capture time. Our game is motivated by the (still unsolved) princess and monster game on a star graph with a large number of leaves. Subject ambush strategynoisy search gamepoisson process To reference this document use: http://resolver.tudelft.nl/uuid:2b755356-0ace-4aee-a059-8cec5b664901 DOI https://doi.org/10.1137/110845665 Publisher Society for Industrial and Applied Mathematics (SIAM) ISSN 0363-0129 Source SIAM Journal on Control and Optimization, 51 (6), 2013 Part of collection Institutional Repository Document type journal article Rights © 2013 SIAM Files PDF Fokkink_2013.pdf 183.01 KB Close viewer /islandora/object/uuid:2b755356-0ace-4aee-a059-8cec5b664901/datastream/OBJ/view