{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:40Z","timestamp":1759638340717,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s00182-021-00761-5","type":"journal-article","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T13:13:10Z","timestamp":1613740390000},"page":"547-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Search for a moving target in a competitive environment"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7191-389X","authenticated-orcid":false,"given":"Benoit","family":"Duvocelle","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Flesch","sequence":"additional","affiliation":[]},{"given":"Hui Min","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Dries","family":"Vermeulen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"761_CR1","volume-title":"The theory of search games and rendezvous","author":"S Alpern","year":"2006","unstructured":"Alpern S, Gal S (2006) The theory of search games and rendezvous. Springer Science & Business Media, New York"},{"key":"761_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6825-7","volume-title":"Search theory","author":"S Alpern","year":"2013","unstructured":"Alpern S, Fokkink R, Gasieniec L, Lindelauf R, Subrahmanian VS (2013) Search theory. Springer, Berlin"},{"issue":"2","key":"761_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.2307\/3215037","volume":"31","author":"D Assaf","year":"1994","unstructured":"Assaf D, Sharlin-Bilitzky A (1994) Dynamic search for a moving target. J Appl Probab 31(2):438\u2013457","journal-title":"J Appl Probab"},{"issue":"4","key":"761_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"SJ Benkoski","year":"1991","unstructured":"Benkoski SJ, Monticino MG, Weisinger JR (1991) A survey of the search theory literature. Naval Res Logist (NRL) 38(4):469\u2013494","journal-title":"Naval Res Logist (NRL)"},{"key":"761_CR5","unstructured":"Duvocelle B, Flesch J, Staudigl M, Vermeulen D (2020) A competitive search game with a moving target. arXiv preprint, arXiv:2008.12032"},{"issue":"6","key":"761_CR6","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1002\/nav.20359","volume":"56","author":"J Flesch","year":"2009","unstructured":"Flesch J, Karag\u00f6zo\u01e7lu E, Perea A (2009) Optimal search for a moving target with the option to wait. Naval Res Logist (NRL) 56(6):526\u2013539","journal-title":"Naval Res Logist (NRL)"},{"issue":"1","key":"761_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0317009","volume":"17","author":"S Gal","year":"1979","unstructured":"Gal S (1979) Search games with mobile and immobile hider. SIAM J Control Optim 17(1):99\u2013122","journal-title":"SIAM J Control Optim"},{"key":"761_CR8","volume-title":"Search games. Wiley Encyclopedia of Operations Research and Management Science","author":"S Gal","year":"2010","unstructured":"Gal S (2010) Search games. Wiley Encyclopedia of Operations Research and Management Science. Wiley, New York"},{"key":"761_CR9","doi-asserted-by":"crossref","unstructured":"Gal S (2013) Search games: a review. In: Search theory. Springer, Berlin, pp 3\u201315","DOI":"10.1007\/978-1-4614-6825-7_1"},{"key":"761_CR10","volume-title":"Search games and other applications of game theory","author":"A Garnaev","year":"2012","unstructured":"Garnaev A (2012) Search games and other applications of game theory. Springer Science and Business Media, New York"},{"issue":"2","key":"761_CR11","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1016\/j.ejor.2019.11.040","volume":"283","author":"T Garrec","year":"2020","unstructured":"Garrec T, Scarsini M (2020) Search for an immobile hider on a stochastic network. Eur J Oper Res 283(2):783\u2013794","journal-title":"Eur J Oper Res"},{"issue":"1","key":"761_CR12","first-page":"1","volume":"59","author":"R Hohzaki","year":"2016","unstructured":"Hohzaki R (2016) Search games: literature and survey. J Oper Res Soc Jpn 59(1):1\u201334","journal-title":"J Oper Res Soc Jpn"},{"key":"761_CR13","unstructured":"Jordan BP (1997) On optimal search for a moving target. PhD thesis, Durham University"},{"key":"761_CR14","first-page":"151","volume":"16","author":"T Nakai","year":"1973","unstructured":"Nakai T (1973) Model of search for a target moving among three boxes: some special cases. J Oper Res Soc Jpn 16:151\u2013162","journal-title":"J Oper Res Soc Jpn"},{"issue":"3","key":"761_CR15","doi-asserted-by":"publisher","first-page":"696","DOI":"10.2307\/3214008","volume":"23","author":"T Nakai","year":"1986","unstructured":"Nakai T (1986) A search game with one object and two searchers. J Appl Probab 23(3):696\u2013707","journal-title":"J Appl Probab"},{"issue":"5","key":"761_CR16","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1287\/opre.18.5.883","volume":"18","author":"SM Pollock","year":"1970","unstructured":"Pollock SM (1970) A simple model of search for a moving target. Oper Res 18(5):883\u2013903","journal-title":"Oper Res"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-021-00761-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00182-021-00761-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-021-00761-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T14:06:53Z","timestamp":1624457213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00182-021-00761-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["761"],"URL":"https:\/\/doi.org\/10.1007\/s00182-021-00761-5","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"type":"print","value":"0020-7276"},{"type":"electronic","value":"1432-1270"}],"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"24 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}