{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:01:31Z","timestamp":1777608091265,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,6,14]],"date-time":"2014-06-14T00:00:00Z","timestamp":1402704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00182-014-0432-z","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T10:06:36Z","timestamp":1403172396000},"page":"347-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Search games on a network with travelling and search costs"],"prefix":"10.1007","volume":"44","author":[{"given":"Vic","family":"Baston","sequence":"first","affiliation":[]},{"given":"Kensaku","family":"Kikuta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,14]]},"reference":[{"key":"432_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":"432_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00182-008-0116-7","volume":"37","author":"S Alpern","year":"2008","unstructured":"Alpern S, Baston V, Gal S (2008) Network search games with immobile hider, without a designated searcher starting point. Int J Game Theory 37:281\u2013302","journal-title":"Int J Game Theory"},{"key":"432_CR3","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1002\/net.20314","volume":"53","author":"S Alpern","year":"2009","unstructured":"Alpern S, Baston V, Gal S (2009) Searching symmetric networks with utilitarian-postman paths. Networks 53:392\u2013402","journal-title":"Networks"},{"key":"432_CR4","series-title":"Kluwer international series in operations research and management sciences","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 sciencesKluwer, Boston"},{"key":"432_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1287\/opre.1120.1134","volume":"61","author":"S Alpern","year":"2013","unstructured":"Alpern S, Lidbetter T (2013) Mining coal or finding terrorists: the expanding search paradigm. Oper Res 61:265\u2013279","journal-title":"Oper Res"},{"key":"432_CR6","doi-asserted-by":"crossref","unstructured":"Alpern S, Lidbetter T (2013) Searching a variable speed network, Math Oper Res. doi: 10.1287\/moor.2013.0634","DOI":"10.1287\/moor.2013.0634"},{"key":"432_CR7","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1002\/net.21504","volume":"62","author":"V Baston","year":"2013","unstructured":"Baston V, Kikuta K (2013) Search games on networks with travelling and search costs and with arbitrary searcher starting points. Networks 62:72\u201379","journal-title":"Networks"},{"key":"432_CR8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20334","volume":"54","author":"E Benavent","year":"2009","unstructured":"Benavent E, Corberan A, Plata I, Sachis J (2009) Min-max K-vehicles windy rural postman problem. Networks 54:216\u2013226","journal-title":"Networks"},{"key":"432_CR9","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/050640886","volume":"22","author":"A Corberan","year":"2008","unstructured":"Corberan A, Plata I, Sachis J (2008) The windy general routing polyhedron: a global view of many known arc routing polyhedra. SIAM J Discr Math 22:606","journal-title":"SIAM J Discr Math"},{"key":"432_CR10","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:156\u2013161","journal-title":"Networks"},{"key":"432_CR11","volume-title":"Search games: a review, Search theory: a game theoretic perspective","author":"S Gal","year":"2013","unstructured":"Gal S (2013) Search games: a review, Search theory: a game theoretic perspective. Springer, New York"},{"key":"432_CR12","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:70\u201388","journal-title":"J Oper Res Soc Jpn"},{"key":"432_CR13","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1002\/nav.20025","volume":"51","author":"K Kikuta","year":"2004","unstructured":"Kikuta K (2004) A search game on a cyclic graph. Nav Res Logist 51:977\u2013993","journal-title":"Nav Res Logist"},{"key":"432_CR14","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:821\u2013831","journal-title":"Nav Res Logist"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-014-0432-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-014-0432-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-014-0432-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T18:17:35Z","timestamp":1565547455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-014-0432-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,14]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s00182-014-0432-z","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,14]]}}}