Search for a moving target in a competitive environment

We consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

[1]  Mathias Staudigl,et al.  A competitive search game with a moving target , 2020, Eur. J. Oper. Res..

[2]  Ryusuke Hohzaki,et al.  SEARCH GAMES : LITERATURE AND SURVEY , 2016 .

[3]  Benjamin Paul Jordan.  On optimal search for a moving target , 1995 .

[4]  Tobias Harks,et al.  Uniqueness of equilibria in atomic splittable polymatroid congestion games , 2018, J. Comb. Optim..

[5]  Teruhisa Nakai.  A search game with one object and two searchers , 1986 .

[6]  János Flesch,et al.  Optimal Search for a Moving Target with the Option to Wait , 2007 .

[7]  Xi Chen,et al.  3-NASH is PPAD-Complete , 2005, Electron. Colloquium Comput. Complex..

[8]  Christos H. Papadimitriou,et al.  On graph-theoretic lemmata and complexity classes , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Marco Scarsini,et al.  When Sally Found Harry: A Stochastic Search Game , 2019, ArXiv.

[10]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[11]  Georges Zaccour,et al.  A shelf-space-dependent wholesale price when manufacturer and retailer brands compete , 2009, OR Spectr..

[12]  A. Garnaev.  Search Games and Other Applications of Game Theory , 2000 .

[13]  Tim Oosterwijk,et al.  A logarithmic approximation for polymatroid congestion games , 2016, Oper. Res. Lett..

[14]  David Assaf,et al.  Dynamic search for a moving target , 1994 .

[15]  Bogdan C. Bichescu,et al.  Vendor-managed inventory and the effect of channel power , 2009, OR Spectr..

[16]  Marco Scarsini,et al.  Search for an immobile hider on a stochastic network , 2020, Eur. J. Oper. Res..

[17]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[19]  Petra Koenig,et al.  Search Games And Other Applications Of Game Theory , 2016 .

[20]  Stephen M. Pollock,et al.  A Simple Model of Search for a Moving Target , 1970, Oper. Res..

[21]  V. S. Subrahmanian,et al.  Search Theory: A Game Theoretic Perspective , 2013 .

[22]  Shmuel Gal,et al.  Search Games: A Review , 2013 .

[23]  Fouad El Ouardighi,et al.  A dynamic game with monopolist manufacturer and price-competing duopolist retailers , 2013, OR Spectr..

[24]  Martin Hoefer,et al.  Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games , 2010, ESA.

[25]  D. Koller,et al.  Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .

[26]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[27]  Rahul Savani,et al.  Hard‐to‐Solve Bimatrix Games , 2006 .

[28]  J. R. Weisinger,et al.  A survey of the search theory literature , 1991 .

[29]  Max Klimm,et al.  On the Existence of Pure Nash Equilibria in Weighted Congestion Games , 2012, Math. Oper. Res..

[30]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[31]  Henry R. Richardson,et al.  Search Theory , 2013, Springer New York.

[32]  Louis Anthony Cox,et al.  Wiley encyclopedia of operations research and management science , 2011 .

[33]  S. Gal.  Search Games with Mobile and Immobile Hider , 1979 .