{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:03Z","timestamp":1742912523908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996592"},{"type":"electronic","value":"9783319996608"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_8","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"82-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hide and Seek Game with Multiple Resources"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Dziubi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaideep","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadinejad, A., Dehghani, S., Hajiaghayi, M., Lucier, B., Mahini, H., Seddighin, S.: From duels to battlefields: computing equilibria of Blotto and other games. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, 12\u201317 February 2016, pp. 376\u2013382. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10036"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., et al.: From battlefields to elections: winning strategies of Blotto and auditing games. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 2291\u20132310 (2018)","DOI":"10.1137\/1.9781611975031.148"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Dehghani, S., Derakhshan, M., Hajiaghayi, M.T., Seddighin, S.: Faster and simpler algorithm for optimal strategies of Blotto game. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, California, USA, 4\u20139 February 2017, pp. 369\u2013375 (2017)","DOI":"10.1609\/aaai.v31i1.10620"},{"key":"8_CR4","first-page":"147","volume":"5","author":"D Birkhoff","year":"1946","unstructured":"Birkhoff, D.: Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista Serie A 5, 147\u2013151 (1946)","journal-title":"Universidad Nacional de Tucuman Revista Serie A"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Borel, \u00c9.: La Th\u00e9orie du Jeu et les \u00c9quations Int\u00e9grales \u00e0 Noyau Sym\u00e9trique. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences 173, 1304\u20131308 (1921). Translated by Savage L.J.: The theory of play and integral equations with skew symmetric kernels. Econometrica 21, 97\u2013100 (1953)","DOI":"10.2307\/1906946"},{"issue":"5","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1257\/aer.97.5.1731","volume":"97","author":"V Crawford","year":"2007","unstructured":"Crawford, V., Iriberri, N.: Fatal attraction: salience, na\u00efvet\u00e9, and sophistication in experimental \u201chide-and-seek\u201d games. Am. Econ. Rev. 97(5), 1731\u20131750 (2007)","journal-title":"Am. Econ. Rev."},{"issue":"3","key":"8_CR7","first-page":"23","volume":"49","author":"L Dulmage","year":"1955","unstructured":"Dulmage, L., Halperin, I.: On a theorem of Frobenius-K\u00f6nig and J. von Neumann\u2019s game of hide and seek. Proc. Trans. R. Soc. Can. 49(3), 23\u201329 (1955)","journal-title":"Proc. Trans. R. Soc. Can."},{"key":"8_CR8","first-page":"9","volume":"85","author":"D Fisher","year":"1991","unstructured":"Fisher, D.: Two person zero-sum games and fractional graph parameters. Congr. Numerantium 85, 9\u201314 (1991)","journal-title":"Congr. Numerantium"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"8_CR10","unstructured":"Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ord\u00f3\u00f1ez, F., Tambe, M.: Computing optimal randomized resource allocations for massive security games. In: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1, AAMAS 2009, IFAAMAS, Richland, SC, pp. 689\u2013696 (2009)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Korzhyk, D., Conitzer, V., Parr, R.: Complexity of computing optimal Stackelberg strategies in security resource allocation games. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010. AAAI Press, Menlo Park (2010)","DOI":"10.1609\/aaai.v24i1.7638"},{"key":"8_CR12","unstructured":"Korzhyk, D., Conitzer, V., Parr, R.: Security games with multiple attacker resources. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 273\u2013279. AAAI Press, Menlo Park (2011)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1613\/jair.3269","volume":"41","author":"D Korzhyk","year":"2011","unstructured":"Korzhyk, D., Yin, Z., Kiekintveld, C., Conitzer, V., Tambe, M.: Stackelberg vs. Nash in security games: an extended investigation of interchangeability, equivalence, and uniqueness. J. Artif. Intell. Res. 41, 297\u2013327 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"von Neumann, J.: A certain zero-sum two-person game equivalent to the optimal assignment problem. In: Contributions to the Theory of Games (AM-28), vol. II, pp. 5\u201312. Princeton University Press (1953)","DOI":"10.1515\/9781400881970-002"},{"key":"8_CR15","volume-title":"Fractional Graph Theory","author":"E Scheinerman","year":"1997","unstructured":"Scheinerman, E., Ullman, D.: Fractional Graph Theory. Wiley, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99660-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:40:41Z","timestamp":1709833241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}