{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T03:48:38Z","timestamp":1768362518630,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF:SPX 1822738, IIS:BIGDATA 1546108"],"award-info":[{"award-number":["CCF:SPX 1822738, IIS:BIGDATA 1546108"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"publisher","award":["SI3CMD"],"award-info":[{"award-number":["SI3CMD"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3328526.3329608","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"597-616","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Strategies of Blotto Games"],"prefix":"10.1145","author":[{"given":"Soheil","family":"Behnezhad","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avrim","family":"Blum","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahsa","family":"Derakhshan","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadtaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Seddighin","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"AmirMahdi Ahmadinejad Sina Dehghani MohammadTaghi Hajiaghayi Brendan Lucier Hamid Mahini and Saeed Seddighin. 2016. From Duels to Battlefields: Computing Equilibria of Blotto and Other Games.. In AAAI. 376--382.  AmirMahdi Ahmadinejad Sina Dehghani MohammadTaghi Hajiaghayi Brendan Lucier Hamid Mahini and Saeed Seddighin. 2016. From Duels to Battlefields: Computing Equilibria of Blotto and Other Games.. In AAAI. 376--382.","DOI":"10.1609\/aaai.v30i1.10036"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.148"},{"key":"e_1_3_2_1_3_1","volume-title":"Optimal Strategies of Blotto Games: Beyond Convexity. arXiv preprint arXiv:1901.04153","author":"Behnezhad Soheil","year":"2019","unstructured":"Soheil Behnezhad , Avrim Blum , Mahsa Derakhshan , MohammadTaghi Hajiaghayi , Christos H Papadimitriou , and Saeed Seddighin . 2019. Optimal Strategies of Blotto Games: Beyond Convexity. arXiv preprint arXiv:1901.04153 ( 2019 ). Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Christos H Papadimitriou, and Saeed Seddighin. 2019. Optimal Strategies of Blotto Games: Beyond Convexity. arXiv preprint arXiv:1901.04153 (2019)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Soheil Behnezhad Sina Dehghani Mahsa Derakhshan MohammadTaghi HajiAghayi and Saeed Seddighin. 2017. Faster and Simpler Algorithm for Optimal Strategies of Blotto Game.. In AAAI. 369--375.  Soheil Behnezhad Sina Dehghani Mahsa Derakhshan MohammadTaghi HajiAghayi and Saeed Seddighin. 2017. Faster and Simpler Algorithm for Optimal Strategies of Blotto Game.. In AAAI. 369--375.","DOI":"10.1609\/aaai.v31i1.10620"},{"key":"e_1_3_2_1_5_1","first-page":"97","article-title":"La th\u00e9orie du jeu et les \u00e9quations int\u00e9grales \u00e0 noyau sym\u00e9trique","volume":"173","author":"Borel \u00c9mile","year":"1921","unstructured":"\u00c9mile Borel . 1921 . La th\u00e9orie du jeu et les \u00e9quations int\u00e9grales \u00e0 noyau sym\u00e9trique . Comptes Rendus de l'Acad\u00e9mie 173 , 13041308 (1921), 97 -- 100 . \u00c9mile Borel. 1921. La th\u00e9orie du jeu et les \u00e9quations int\u00e9grales \u00e0 noyau sym\u00e9trique. Comptes Rendus de l'Acad\u00e9mie 173, 13041308 (1921), 97--100.","journal-title":"Comptes Rendus de l'Acad\u00e9mie"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2307\/1906946"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Subhasish M Chowdhury Dan Kovenock and Roman M Sheremeta. 2009. An experimental investigation of Colonel Blotto games. (2009).  Subhasish M Chowdhury Dan Kovenock and Roman M Sheremeta. 2009. An experimental investigation of Colonel Blotto games. (2009).","DOI":"10.2139\/ssrn.1430284"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory-Volume 94","author":"Estivill-Castro Vladimir","year":"2009","unstructured":"Vladimir Estivill-Castro and Mahdi Parsa . 2009 . Computing Nash equilibria gets harder: new results show hardness even for parameterized complexity . In Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory-Volume 94 . Australian Computer Society, Inc., 83--90. Vladimir Estivill-Castro and Mahdi Parsa. 2009. Computing Nash equilibria gets harder: new results show hardness even for parameterized complexity. In Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory-Volume 94. Australian Computer Society, Inc., 83--90."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/1906949"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/1906945"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8256(89)90006-7"},{"key":"e_1_3_2_1_12_1","unstructured":"Oliver Alfred Gross and RA Wagner. 1950. A continuous Colonel Blotto game. (1950).  Oliver Alfred Gross and RA Wagner. 1950. A continuous Colonel Blotto game. (1950)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-007-0099-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-011-0288-4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993666"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Dan Kovenock and Brian Roberson. 2010. Conflicts with multiple battlefields. (2010).  Dan Kovenock and Brian Roberson. 2010. Conflicts with multiple battlefields. (2010).","DOI":"10.2139\/ssrn.1679624"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9779.2012.01556.x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2775"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779933"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11127-005-3209-x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/2938819"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-011-0673-z"},{"key":"e_1_3_2_1_23_1","volume-title":"Modeling bounded rationality","author":"Rubinstein Ariel","unstructured":"Ariel Rubinstein . 1998. Modeling bounded rationality . MIT press . Ariel Rubinstein. 1998. Modeling bounded rationality. MIT press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800280210"},{"key":"e_1_3_2_1_25_1","volume-title":"Models of bounded rationality: Empirically grounded economic reason","author":"Simon Herbert Alexander","unstructured":"Herbert Alexander Simon . 1982. Models of bounded rationality: Empirically grounded economic reason . Vol. 3 . MIT press . Herbert Alexander Simon. 1982. Models of bounded rationality: Empirically grounded economic reason. Vol. 3. MIT press."}],"event":{"name":"EC '19: ACM Conference on Economics and Computation","location":"Phoenix AZ USA","acronym":"EC '19","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2019 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329608","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3328526.3329608","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3328526.3329608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:41Z","timestamp":1750204421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329608"}},"subtitle":["Beyond Convexity"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":25,"alternative-id":["10.1145\/3328526.3329608","10.1145\/3328526"],"URL":"https:\/\/doi.org\/10.1145\/3328526.3329608","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}