{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:50Z","timestamp":1759847390012},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,2,13]],"date-time":"2008-02-13T00:00:00Z","timestamp":1202860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s00182-008-0116-7","type":"journal-article","created":{"date-parts":[[2008,2,12]],"date-time":"2008-02-12T16:50:25Z","timestamp":1202835025000},"page":"281-302","source":"Crossref","is-referenced-by-count":22,"title":["Network search games with immobile hider, without a designated searcher starting point"],"prefix":"10.1007","volume":"37","author":[{"given":"Steve","family":"Alpern","sequence":"first","affiliation":[]},{"given":"Vic","family":"Baston","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Gal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,2,13]]},"reference":[{"key":"116_CR1","first-page":"181","volume-title":"Differential games and control theory","author":"S Alpern","year":"1974","unstructured":"Alpern S (1974) The search game with mobile hider on the circle. In: Roxin EO, Liu PT, Sternberg RL(eds) Differential games and control theory. M. Dekker, New York, pp 181\u2013200"},{"key":"116_CR2","doi-asserted-by":"crossref","unstructured":"Alpern S (2008) Hide-and-seek games on a tree to which Eulerian networks are attached. Networks (in press)","DOI":"10.1002\/net.20235"},{"issue":"2","key":"116_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.3230150208","volume":"15","author":"S Alpern","year":"1985","unstructured":"Alpern S, Asic M (1985) The search value of a network. Networks 15(2): 229\u2013238","journal-title":"Networks"},{"key":"116_CR4","first-page":"319","volume-title":"The theory of search games and rendezvous. Kluwer International Series in Operations Research and Management Sciences","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, Boston, p 319"},{"key":"116_CR5","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: 319\u2013339","journal-title":"Dyn Control"},{"issue":"7","key":"116_CR6","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1002\/net.3230200703","volume":"20","author":"EJ Anderson","year":"1990","unstructured":"Anderson EJ, Aramendia MA (1990) The search game on a network with immobile hider. Networks 20(7): 817\u2013844","journal-title":"Networks"},{"key":"116_CR7","first-page":"419","volume":"8","author":"A Beck","year":"1970","unstructured":"Beck A, Newman DJ (1970) Yet more on the linear search problem. Nav Res Logist 8: 419\u2013429","journal-title":"Nav Res Logist"},{"key":"116_CR8","unstructured":"Dagan A (2005) Strategies for searching graphs with an arbitrary starting point, MSc Thesis, University of Haifa"},{"key":"116_CR9","doi-asserted-by":"crossref","unstructured":"Dagan A, Gal S (2008) Network search games with arbitrary searcher starting point. Networks (in press)","DOI":"10.1002\/net.20241"},{"key":"116_CR10","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"E Demaine","year":"2006","unstructured":"Demaine E, Fekete S, Gal S (2006) Online searching with turn cost. Theor Comput Sci 361: 342\u2013355","journal-title":"Theor Comput Sci"},{"issue":"2","key":"116_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.10108","volume":"43","author":"D Dvir","year":"2004","unstructured":"Dvir D, Handler GY (2004) The absolute center of a network. Networks 43(2): 109\u2013118","journal-title":"Networks"},{"key":"116_CR12","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds J, Johnson EL (1973) Matching Euler tours and the Chinese postman problem. Math Program 5: 88\u2013124","journal-title":"Math Program"},{"key":"116_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt HA, Gendreau M, Laporte G (1995) Arc routing problems I. The Chinese postman problem. Oper Res 43: 231\u2013242","journal-title":"Oper Res"},{"key":"116_CR14","volume-title":"Search games","author":"S Gal","year":"1980","unstructured":"Gal S (1980) Search games. Academic Press, New York"},{"key":"116_CR15","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":"116_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-57304-0","volume-title":"Search games and other applications of game theory","author":"AY Garnaev","year":"2000","unstructured":"Garnaev AY (2000) Search games and other applications of game theory. Springer, Berlin"},{"key":"116_CR17","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S Hakimi","year":"1964","unstructured":"Hakimi S (1964) Optimal locations of switching centers and medians of a graph. Oper Res 12: 450\u2013459","journal-title":"Oper Res"},{"key":"116_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R Hassin","year":"1995","unstructured":"Hassin R, Tamir A (1995) On the minimum diameter spanning tree problem. Inf Process Lett 53: 109\u2013111","journal-title":"Inf Process Lett"},{"key":"116_CR19","volume-title":"Differential games","author":"R Isaacs","year":"1965","unstructured":"Isaacs R (1965) Differential games. Wiley, New York"},{"issue":"1","key":"116_CR20","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 traveling cost on a tree. J Oper Res Soc Jpn 38(1): 70\u201388","journal-title":"J Oper Res Soc Jpn"},{"issue":"4","key":"116_CR21","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo N, Tamir A (1983) New results on the complexity of p-center problems. SIAM J Comput 12(4): 751\u2013758","journal-title":"SIAM J Comput"},{"issue":"8","key":"116_CR22","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\u20131189","journal-title":"Nav Res Logist"},{"key":"116_CR23","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01240153","volume":"21","author":"JH Reijnierse","year":"1993","unstructured":"Reijnierse JH, Potters JAM (1993) Search games with immobile hider. Int J Game Theory 21: 385\u2013394","journal-title":"Int J Game Theory"},{"key":"116_CR24","volume-title":"Geometric games and their applications","author":"WH Ruckle","year":"1983","unstructured":"Ruckle WH (1983) Geometric games and their applications. Pitman, Boston"},{"key":"116_CR25","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0166-218X(97)00011-5","volume":"78","author":"B Stengel von","year":"1997","unstructured":"von Stengel B, Werchner R (1997) Complexity of searching an immobile hider in a graph. Discrete Appl Math 78: 235\u2013249","journal-title":"Discrete Appl Math"},{"key":"116_CR26","first-page":"228","volume":"13","author":"MI Zeliken","year":"1972","unstructured":"Zeliken MI (1972) On a differential game with incomplete information. Sov Math Dokl 13: 228\u2013231","journal-title":"Sov Math Dokl"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-008-0116-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-008-0116-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-008-0116-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:40:45Z","timestamp":1558636845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-008-0116-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,13]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["116"],"URL":"https:\/\/doi.org\/10.1007\/s00182-008-0116-7","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,13]]}}}