{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:09Z","timestamp":1759847289133},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,26]],"date-time":"2011-02-26T00:00:00Z","timestamp":1298678400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s13235-011-0009-4","type":"journal-article","created":{"date-parts":[[2011,2,25]],"date-time":"2011-02-25T17:46:20Z","timestamp":1298655980000},"page":"209-219","source":"Crossref","is-referenced-by-count":8,"title":["A New Approach to Gal\u2019s Theory of\u00a0Search Games on\u00a0Weakly Eulerian Networks"],"prefix":"10.1007","volume":"1","author":[{"given":"Steve","family":"Alpern","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,26]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"5547","DOI":"10.1137\/090781115","volume":"48","author":"S Alpern","year":"2010","unstructured":"Alpern S (2010) Search games on trees with asymmetric travel times. SIAM J Control Optim 48:5547\u20135563","journal-title":"SIAM J Control Optim"},{"key":"9_CR2","unstructured":"Alpern S (2010) A search game model of optimal foraging on a network. LSE operational research working paper series, LSEOR 10.124"},{"key":"9_CR3","unstructured":"Alpern S, Find-and-fetch search on a tree. Oper Res (to appear)"},{"key":"9_CR4","unstructured":"Alpern S, Lidbetter T (2010) Searching a variable speed network. London School of Economics Operational Research Working Papers, LSE WP 10-129"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1137\/0326077","volume":"26","author":"S Alpern","year":"1988","unstructured":"Alpern S, Gal S (1988) A mixed strategy minimax theorem without compactness. SIAM J Control Optim 26:1357\u20131361","journal-title":"SIAM J Control Optim"},{"key":"9_CR6","series-title":"Kluwer international series in operations research and management sciences","first-page":"319","volume-title":"The theory of search games and rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer international series in operations research and management sciences. Kluwer Academic, Boston, p\u00a0319"},{"issue":"4","key":"9_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1011245715521","volume":"10","author":"S Alpern","year":"2000","unstructured":"Alpern S, Howard JV (2000) Alternating search at two locations. Dyn Control 10(4):319\u2013339","journal-title":"Dyn Control"},{"issue":"3","key":"9_CR8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1002\/net.20241","volume":"52","author":"A Dagan","year":"2008","unstructured":"Dagan A, Gal S (2008) Network search games, with arbitrary searcher starting point. Networks 52(3):156\u2013161","journal-title":"Networks"},{"key":"9_CR9","doi-asserted-by":"crossref","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:99\u2013122","journal-title":"SIAM J Control Optim"},{"key":"9_CR10","volume-title":"Search games","author":"S Gal","year":"1980","unstructured":"Gal S (1980) Search games. Academic Press, New York"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s001820000056","volume":"29","author":"S Gal","year":"2000","unstructured":"Gal S (2000) On the optimality of a simple strategy for searching graphs. Int J Game Theory 29:533\u2013542","journal-title":"Int J Game Theory"},{"key":"9_CR12","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-57304-0","volume-title":"Search games and other applications of game theory","author":"A Garnaev","year":"2000","unstructured":"Garnaev A (2000) Search games and other applications of game theory. Lecture notes in economics and mathematical systems, vol\u00a0485. Springer, Berlin"},{"key":"9_CR13","volume-title":"Differential games","author":"R Isaacs","year":"1965","unstructured":"Isaacs R (1965) Differential games. Wiley, New York"},{"issue":"1","key":"9_CR14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.15807\/jorsj.38.70","volume":"38","author":"K Kikuta","year":"1995","unstructured":"Kikuta K (1995) A search game with travelling cost on a tree. J Oper Res Soc Jpn 38(1):70\u201388","journal-title":"J Oper Res Soc Jpn"},{"issue":"6","key":"9_CR15","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1002\/1520-6750(199410)41:6<821::AID-NAV3220410610>3.0.CO;2-Y","volume":"41","author":"K Kikuta","year":"1994","unstructured":"Kikuta K, Ruckle W (1994) Initial point search on weighted trees. Nav Res Logist 41(6):821\u2013831","journal-title":"Nav Res Logist"},{"issue":"8","key":"9_CR16","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1002\/1520-6750(199512)42:8<1177::AID-NAV3220420805>3.0.CO;2-R","volume":"42","author":"L Pavlovic","year":"1995","unstructured":"Pavlovic L (1995) A search game on the union of graphs with immobile hider. Nav Res Logist 42(8):1177\u20131199","journal-title":"Nav Res Logist"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01240153","volume":"21","author":"JH Reijnierse","year":"1993","unstructured":"Reijnierse JH, Potter JAM (1993) Search games with immobile hider. Int J Game Theory 21:385\u2013394","journal-title":"Int J Game Theory"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-011-0009-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13235-011-0009-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-011-0009-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T21:32:40Z","timestamp":1560029560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13235-011-0009-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,26]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s13235-011-0009-4","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"value":"2153-0785","type":"print"},{"value":"2153-0793","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,26]]}}}