{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:04Z","timestamp":1740123184754,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T00:00:00Z","timestamp":1466985600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001831","name":"Delft University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001831","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10479-016-2252-y","type":"journal-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T05:30:02Z","timestamp":1467005402000},"page":"63-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The search value of a set"],"prefix":"10.1007","volume":"256","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8347-4110","authenticated-orcid":false,"given":"Robbert","family":"Fokkink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"Kikuta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Ramsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,27]]},"reference":[{"issue":"2","key":"2252_CR1","doi-asserted-by":"publisher","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. doi:\n                        10.1002\/net.3230150208\n                        \n                    .","journal-title":"Networks"},{"key":"2252_CR2","volume-title":"Search games and rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern, S., & Gal, S. (2003). Search games and rendezvous. Berlin: Springer."},{"key":"2252_CR3","volume-title":"Search theory, a game theoretic approach","author":"S Alpern","year":"2013","unstructured":"Alpern, S., Fokkink, R., Gasieniec, L., & Subrahmanian, V. S. (2013). Search theory, a game theoretic approach. Berlin: Springer."},{"key":"2252_CR4","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. Operations Research, 61, 265\u2013279.","journal-title":"Operations Research"},{"key":"2252_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02579341","volume":"3","author":"W Cunningham","year":"1983","unstructured":"Cunningham, W. (1983). Decomposition of submodular functions. Combinatorica, 3, 53\u201368.","journal-title":"Combinatorica"},{"key":"2252_CR6","first-page":"17","volume":"28","author":"R Fokkink","year":"2015","unstructured":"Fokkink, R., Ramsey, D., & Kikuta, K. (2015). A search game with a non-additive cost. Scientiae Mathematicae Japonicae, 28, 17\u20132015.","journal-title":"Scientiae Mathematicae Japonicae"},{"key":"2252_CR7","volume-title":"Submodular functions and optimization, Annals of discrete mathematics 58","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S. (2005). Submodular functions and optimization, Annals of discrete mathematics 58. Amsterdam: Elsevier."},{"key":"2252_CR8","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 Journal on Control and Optimization, 17, 99\u2013122.","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"4","key":"2252_CR9","doi-asserted-by":"crossref","first-page":"3056","DOI":"10.1137\/120893938","volume":"51","author":"T Lidbetter","year":"2013","unstructured":"Lidbetter, T. (2013). Search for multiple hidden objects. SIAM Journal on Control and Optimization, 51(4), 3056\u20133074.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"2252_CR10","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L. (1983) Submodular functions and convexity, In Mathematical Programming - the state of the art (pp. 235\u2013257). Berlin: Springer.","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"2252_CR11","unstructured":"Shapley, L. S. (1953). A value for n-person games, contributions to the theory of games. In H. W. Kuhn & A. W. Tucker (Eds.), Annals of mathematics studies 28 (II ed., pp. 307\u2013317). Princeton: Princeton University Press."},{"key":"2252_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 111\u2013130.","journal-title":"International Journal of Game Theory"},{"key":"2252_CR13","unstructured":"Schrijver, A. (2003) Combinatorial optimization, polyhedra and efficiency, Algorithms and Combinatorics 24. Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2252-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2252-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2252-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2252-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T00:13:12Z","timestamp":1589674392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2252-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,27]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2252"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2252-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2016,6,27]]}}}