{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:10Z","timestamp":1759847950102},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171963"},{"type":"electronic","value":"9783642171970"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17197-0_15","type":"book-chapter","created":{"date-parts":[[2010,11,22]],"date-time":"2010-11-22T15:35:06Z","timestamp":1290440106000},"page":"220-233","source":"Crossref","is-referenced-by-count":2,"title":["Disperse or Unite? A Mathematical Model of Coordinated Attack"],"prefix":"10.1007","author":[{"given":"Steve","family":"Alpern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robbert","family":"Fokkink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joram","family":"op den Kelder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Lidbetter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Alpern, S., Clayton, N., Fokkink, R., Lidbetter, T.: A game theoretic model for nut caching by scatter hoarders (2010) (preprint)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1137\/0326077","volume":"26","author":"S. Alpern","year":"1988","unstructured":"Alpern, S., Gal, S.: A Mixed Strategy Minimax Theorem without Compactness. SIAM J. Control Optim.\u00a026, 1357\u20131361 (1988)","journal-title":"SIAM J. Control Optim."},{"key":"15_CR3","volume-title":"The theory of search games and rendezvous","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Kluwer, Dordrecht (2003)"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1111\/j.1467-9779.2007.00320.x","volume":"9","author":"V. Bier","year":"2007","unstructured":"Bier, V., Olivers, S., Samuelson, L.: Choosing what to protect. Defensive allocation against an unknown attacker. J. Publ. Economic Th.\u00a09(4), 563\u2013587 (2007)","journal-title":"J. Publ. Economic Th."},{"key":"15_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2002","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2002)","edition":"2"},{"key":"15_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57304-0","volume-title":"Search games and other applications of game theory","author":"A.Y. Garnaev","year":"2000","unstructured":"Garnaev, A.Y.: Search games and other applications of game theory. Springer, Heidelberg (2000)"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1214\/aos\/1176342467","volume":"1","author":"R. McEliece","year":"1973","unstructured":"McEliece, R., Posner, E.: Hiding and covering in a compact metric space. Ann. Stat.\u00a01(4), 729\u2013739 (1973)","journal-title":"Ann. Stat."},{"key":"15_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-09442-6","volume-title":"Mathematical methods in counterterrorism","author":"N. Memon","year":"2009","unstructured":"Memon, N., Farley, J.D., Hicks, D.L., Rosenorn, T.: Mathematical methods in counterterrorism. Springer, Heidelberg (2009)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1016\/j.cor.2006.09.020","volume":"35","author":"G. Owen","year":"2008","unstructured":"Owen, G., McCormick, G.H.: Finding a moving fugitive. A game theoretic representation of search. Comp. Oper. Res.\u00a035, 1944\u20131962 (2008)","journal-title":"Comp. Oper. Res."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01240153","volume":"21","author":"J.H. Reijnierse","year":"1993","unstructured":"Reijnierse, J.H., Potters, J.A.M.: Search games with an immobile hider. Int. J. Game Theory\u00a021, 385\u2013394 (1993)","journal-title":"Int. J. Game Theory"},{"key":"15_CR11","unstructured":"Ruckle, W.H.: Geometric games and their applications. Pitman (1983)"},{"key":"15_CR12","unstructured":"Statement of Peter Clarke, head of Scotland Yard\u2019s anti-terrorist branch (August 10, 2006), \n                    \n                      http:\/\/news.bbc.co.uk\/2\/hi\/4778575.stm"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.ejor.2008.02.007","volume":"195","author":"N. Zoroa","year":"2009","unstructured":"Zoroa, N., Zoroa, P., Fern\u00e1ndez-S\u00e1ez, M.J.: Weighted search games. European J. Oper. Res.\u00a0195, 394\u2013411 (2009)","journal-title":"European J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17197-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T21:32:58Z","timestamp":1548451978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17197-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171963","9783642171970"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17197-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}