{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T05:29:15Z","timestamp":1792819755284,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T00:00:00Z","timestamp":1452729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Templeton Foundation","award":["3966"],"award-info":[{"award-number":["3966"]}],"id":[{"id":"https:\/\/ror.org\/035tnyy05","id-type":"ROR","asserted-by":"crossref"}]},{"name":"National Science Foundation","award":["DMS-1400558"],"award-info":[{"award-number":["DMS-1400558"]}]},{"name":"National Science Foundation","award":["CCF1408635"],"award-info":[{"award-number":["CCF1408635"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,14]]},"DOI":"10.1145\/2840728.2840730","type":"proceedings-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T09:26:11Z","timestamp":1451985971000},"page":"111-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":136,"title":["Strategic Classification"],"prefix":"10.1145","author":[{"given":"Moritz","family":"Hardt","sequence":"first","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nimrod","family":"Megiddo","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Theory of classification: A survey of some recent advances. ESAIM: probability and statistics, 9:323--375","author":"Boucheron St\u00e9phane","year":"2005","unstructured":"St\u00e9phane Boucheron , Olivier Bousquet , and G\u00e1bor Lugosi . Theory of classification: A survey of some recent advances. ESAIM: probability and statistics, 9:323--375 , 2005 . St\u00e9phane Boucheron, Olivier Bousquet, and G\u00e1bor Lugosi. Theory of classification: A survey of some recent advances. ESAIM: probability and statistics, 9:323--375, 2005."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503326"},{"key":"e_1_3_2_1_3_1","first-page":"171","volume-title":"Proc. 23rd NIPS 2009","author":"Br\u00fcckner Michael","year":"2009","unstructured":"Michael Br\u00fcckner and Tobias Scheffer . Nash equilibria of static prediction games . In Proc. 23rd NIPS 2009 , pages 171 -- 179 , 2009 . Michael Br\u00fcckner and Tobias Scheffer. Nash equilibria of static prediction games. In Proc. 23rd NIPS 2009, pages 171--179, 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020495"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.108"},{"key":"e_1_3_2_1_6_1","volume-title":"The scored society: Due process for automated predictions. 89 Washington Law Review, 1","author":"Citron Danielle Keats","year":"2014","unstructured":"Danielle Keats Citron and Frank Pasquale . The scored society: Due process for automated predictions. 89 Washington Law Review, 1 , 2014 . Danielle Keats Citron and Frank Pasquale. The scored society: Due process for automated predictions. 89 Washington Law Review, 1, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014066"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.rssm.2010.01.002"},{"key":"e_1_3_2_1_9_1","first-page":"55","volume-title":"Proc. 30th ICML","author":"Gro\u00dfhans Michael","year":"2013","unstructured":"Michael Gro\u00dfhans , Christoph Sawade , Michael Br\u00fcckner , and Tobias Scheffer . Bayesian games for adversarial regression problems . In Proc. 30th ICML , pages 55 -- 63 , 2013 . Michael Gro\u00dfhans, Christoph Sawade, Michael Br\u00fcckner, and Tobias Scheffer. Bayesian games for adversarial regression problems. In Proc. 30th ICML, pages 55--63, 2013."},{"key":"e_1_3_2_1_10_1","volume-title":"Strategic classification. CoRR, abs\/1506.06980","author":"Hardt Moritz","year":"2015","unstructured":"Moritz Hardt , Nimrod Megiddo , Christos H. Papadimitriou , and Mary Wootters . Strategic classification. CoRR, abs\/1506.06980 , 2015 . Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, and Mary Wootters. Strategic classification. CoRR, abs\/1506.06980, 2015."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. AAAI","author":"Korzhyk Dmytro","year":"2010","unstructured":"Dmytro Korzhyk , Vincent Conitzer , and Ronald Parr . Complexity of computing optimal Stackelberg strategies in security resource allocation games . In Proc. AAAI , 2010 . Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Complexity of computing optimal Stackelberg strategies in security resource allocation games. In Proc. AAAI, 2010."},{"key":"e_1_3_2_1_12_1","volume-title":"Stackelberg vs. Nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. J. Artif. Intell. Res.(JAIR), 41:297--327","author":"Korzhyk Dmytro","year":"2011","unstructured":"Dmytro Korzhyk , Zhengyu Yin , Christopher Kiekintveld , Vincent Conitzer , and Milind Tambe . Stackelberg vs. Nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. J. Artif. Intell. Res.(JAIR), 41:297--327 , 2011 . Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintveld, Vincent Conitzer, and Milind Tambe. Stackelberg vs. Nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. J. Artif. Intell. Res.(JAIR), 41:297--327, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach Spaces: isoperimetry and processes","author":"Ledoux Michel","year":"1991","unstructured":"Michel Ledoux and Michel Talagrand . Probability in Banach Spaces: isoperimetry and processes , volume 23 . Springer , 1991 . Michel Ledoux and Michel Talagrand. Probability in Banach Spaces: isoperimetry and processes, volume 23. Springer, 1991."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"}],"event":{"name":"ITCS'16: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts USA","acronym":"ITCS'16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2840728.2840730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:53:46Z","timestamp":1750208026000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":14,"alternative-id":["10.1145\/2840728.2840730","10.1145\/2840728"],"URL":"https:\/\/doi.org\/10.1145\/2840728.2840730","relation":{},"subject":[],"published":{"date-parts":[[2016,1,14]]},"assertion":[{"value":"2016-01-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}