{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T10:34:46Z","timestamp":1790246086891,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T00:00:00Z","timestamp":1434326400000},"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-1116892, IIS-1065251, CCF-1415460, CCF-1215883, IIS-1350598, CCF-1451177, CCF-1422910, CCF-1101283"],"award-info":[{"award-number":["CCF-1116892, IIS-1065251, CCF-1415460, CCF-1215883, IIS-1350598, CCF-1451177, CCF-1422910, CCF-1101283"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["Microsoft Research Faculty Fellowship"],"award-info":[{"award-number":["Microsoft Research Faculty Fellowship"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["Two Sloan Research Fellowships"],"award-info":[{"award-number":["Two Sloan Research Fellowships"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,15]]},"DOI":"10.1145\/2764468.2764478","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"61-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Commitment Without Regrets"],"prefix":"10.1145","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avrim","family":"Blum","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nika","family":"Haghtalab","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel D.","family":"Procaccia","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI). 1242--1248","author":"An B.","unstructured":"An , B. , Kempe , D. , Kiekintveld , C. , Shieh , E. , Singh , S. P. , Tambe , M. , and Vorobeychik , Y . 2012. Security games with limited surveillance . In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI). 1242--1248 . An, B., Kempe, D., Kiekintveld, C., Shieh, E., Singh, S. P., Tambe, M., and Vorobeychik, Y. 2012. Security games with limited surveillance. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI). 1242--1248."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS). 322--331","author":"Auer P.","unstructured":"Auer , P. , Cesa-Bianchi , N. , Freund , Y. , and Schapire , R. E . 1995. Gambling in a rigged casino: The adversarial multi-armed bandit problem . In Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS). 322--331 . Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. 1995. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS). 322--331."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.016"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872090"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). 573--579","author":"Blum A.","unstructured":"Blum , A. , Haghtalab , N. , and Procaccia , A. D . 2014a. Lazy defenders are almost optimal against diligent attackers . In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). 573--579 . Blum, A., Haghtalab, N., and Procaccia, A. D. 2014a. Lazy defenders are almost optimal against diligent attackers. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). 573--579."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NIPS). 1826--1834","author":"Blum A.","unstructured":"Blum , A. , Haghtalab , N. , and Procaccia , A. D . 2014b. Learning optimal commitment to overcome insecurity . In Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NIPS). 1826--1834 . Blum, A., Haghtalab, N., and Procaccia, A. D. 2014b. Learning optimal commitment to overcome insecurity. In Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NIPS). 1826--1834."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Blum A. and Mansour Y. 2007. Learning regret minimization and equilibria. In Algorithmic Game Theory N. Nisan T. Roughgarden E. Tardos and V. Vazirani Eds. Cambridge University Press Chapter 4.  Blum A. and Mansour Y. 2007. Learning regret minimization and equilibria. In Algorithmic Game Theory N. Nisan T. Roughgarden E. Tardos and V. Vazirani Eds. Cambridge University Press Chapter 4.","DOI":"10.1017\/CBO9780511800481.006"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Bubeck S. and Cesa-Bianchi N. 2012. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. CoRR abs\/1204.5721.  Bubeck S. and Cesa-Bianchi N. 2012. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. CoRR abs\/1204.5721.","DOI":"10.1561\/9781601986276"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5001-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134717"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02786-9_8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 10th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 1005--1012","author":"Kiekintveld C.","unstructured":"Kiekintveld , C. , Marecki , J. , and Tambe , M . 2011. Approximation methods for infinite Bayesian Stackelberg games: Modeling distributional payoff uncertainty . In Proceedings of the 10th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 1005--1012 . Kiekintveld, C., Marecki, J., and Tambe, M. 2011. Approximation methods for infinite Bayesian Stackelberg games: Modeling distributional payoff uncertainty. In Proceedings of the 10th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 1005--1012."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI). 805--810","author":"Korzhyk D.","unstructured":"Korzhyk , D. , Conitzer , V. , and Parr , R . 2010. Complexity of computing optimal Stackelberg strategies in security resource allocation games . In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI). 805--810 . Korzhyk, D., Conitzer, V., and Parr, R. 2010. Complexity of computing optimal Stackelberg strategies in security resource allocation games. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI). 805--810."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_23"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 821--828","author":"Marecki J.","unstructured":"Marecki , J. , Tesauro , G. , and Segal , R . 2012. Playing repeated Stackelberg games with unknown opponents . In Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 821--828 . Marecki, J., Tesauro, G., and Segal, R. 2012. Playing repeated Stackelberg games with unknown opponents. In Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 821--828."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.07.002"},{"key":"e_1_3_2_1_19_1","volume-title":"Deployed Systems, Lessons Learned","author":"Tambe M.","unstructured":"Tambe , M. 2012. Security and Game Theory: Algorithms , Deployed Systems, Lessons Learned . Cambridge University Press . Tambe, M. 2012. Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press."},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 13th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 453--460","author":"Yang R.","unstructured":"Yang , R. , Ford , B. J. , Tambe , M. , and Lemieux , A . 2014. Adaptive resource allocation for wildlife protection against illegal poachers . In Proceedings of the 13th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 453--460 . Yang, R., Ford, B. J., Tambe, M., and Lemieux, A. 2014. Adaptive resource allocation for wildlife protection against illegal poachers. In Proceedings of the 13th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 453--460."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML). 928--936","author":"Zinkevich M.","year":"2003","unstructured":"Zinkevich , M. 2003 . Online convex programming and generalized infinitesimal gradient ascent . In Proceedings of the 20th International Conference on Machine Learning (ICML). 928--936 . Zinkevich, M. 2003. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th International Conference on Machine Learning (ICML). 928--936."}],"event":{"name":"EC '15: ACM Conference on Economics and Computation","location":"Portland Oregon USA","acronym":"EC '15","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the Sixteenth ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764478","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764468.2764478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:19Z","timestamp":1750273459000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764478"}},"subtitle":["Online Learning in Stackelberg Security Games"],"short-title":[],"issued":{"date-parts":[[2015,6,15]]},"references-count":21,"alternative-id":["10.1145\/2764468.2764478","10.1145\/2764468"],"URL":"https:\/\/doi.org\/10.1145\/2764468.2764478","relation":{},"subject":[],"published":{"date-parts":[[2015,6,15]]},"assertion":[{"value":"2015-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}