{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:36:01Z","timestamp":1730320561843,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1253345"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3219166.3219193","type":"proceedings-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T12:36:46Z","timestamp":1529411806000},"page":"55-70","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Strategic Classification from Revealed Preferences"],"prefix":"10.1145","author":[{"given":"Jinshuo","family":"Dong","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Zachary","family":"Schutzman","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Bo","family":"Waggoner","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Zhiwei Steven","family":"Wu","sequence":"additional","affiliation":[{"name":"Microsoft Research, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Kareem Amin Rachel Cummings Lili Dworkin Michael Kearns and Aaron Roth. 2015. Online Learning and Profit Maximization from Revealed Preferences. AAAI. 770--776. Kareem Amin Rachel Cummings Lili Dworkin Michael Kearns and Aaron Roth. 2015. Online Learning and Profit Maximization from Revealed Preferences. AAAI. 770--776.","DOI":"10.1609\/aaai.v29i1.9332"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764478"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Maria-Florina Balcan Amit Daniely Ruta Mehta Ruth Urner and Vijay V Vazirani. 2014. Learning economic parameters from revealed preferences International Conference on Web and Internet Economics. Springer 338--353. Maria-Florina Balcan Amit Daniely Ruta Mehta Ruth Urner and Vijay V Vazirani. 2014. Learning economic parameters from revealed preferences International Conference on Web and Internet Economics. Springer 338--353.","DOI":"10.1007\/978-3-319-13129-0_28"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134712"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Aharon Ben-Tal and Arkadi Nemirovski. 2001. Lectures on modern convex optimization: analysis algorithms and engineering applications. SIAM. Aharon Ben-Tal and Arkadi Nemirovski. 2001. Lectures on modern convex optimization: analysis algorithms and engineering applications. SIAM.","DOI":"10.1137\/1.9780898718829"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503326"},{"key":"e_1_3_2_2_7_1","unstructured":"Michael Br\u00fcckner and Tobias Scheffer. 2009. Nash equilibria of static prediction games. In Advances in neural information processing systems. 171--179. Michael Br\u00fcckner and Tobias Scheffer. 2009. Nash equilibria of static prediction games. In Advances in neural information processing systems. 171--179."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020495"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055403"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014066"},{"key":"e_1_3_2_2_12_1","unstructured":"Abraham D Flaxman Adam Tauman Kalai and H Brendan McMahan. 2005. Online convex optimization in the bandit setting: gradient descent without a gradient Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics 385--394. Abraham D Flaxman Adam Tauman Kalai and H Brendan McMahan. 2005. Online convex optimization in the bandit setting: gradient descent without a gradient Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics 385--394."},{"key":"e_1_3_2_2_13_1","unstructured":"Michael Gro\u00dfhans Christoph Sawade Michael Br\u00fcckner and Tobias Scheffer. 2013. Bayesian games for adversarial regression problems International Conference on Machine Learning. 55--63. Michael Gro\u00dfhans Christoph Sawade Michael Br\u00fcckner and Tobias Scheffer. 2013. Bayesian games for adversarial regression problems International Conference on Machine Learning. 55--63."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840730"},{"key":"e_1_3_2_2_15_1","unstructured":"Shahin Jabbari Ryan M Rogers Aaron Roth and Steven Z Wu. 2016. Learning from rational behavior: Predicting solutions to unknown linear programs Advances in Neural Information Processing Systems. 1570--1578. Shahin Jabbari Ryan M Rogers Aaron Roth and Steven Z Wu. 2016. Learning from rational behavior: Predicting solutions to unknown linear programs Advances in Neural Information Processing Systems. 1570--1578."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Dmytro Korzhyk Vincent Conitzer and Ronald Parr. 2010. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games.. In AAAI. Dmytro Korzhyk Vincent Conitzer and Ronald Parr. 2010. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games.. In AAAI.","DOI":"10.1609\/aaai.v24i1.7638"},{"key":"e_1_3_2_2_17_1","volume-title":"Foundations and Trends\u00ae in Machine Learning","volume":"5","author":"Brian","year":"2013"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.9"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Ralph Tyrell Rockafellar. 1970. Convex analysis. Princeton University Press. Ralph Tyrell Rockafellar. 1970. Convex analysis. Princeton University Press.","DOI":"10.1515\/9781400873173"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085106"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897579"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Milind Tambe. 2011. Security and game theory: algorithms deployed systems lessons learned. Cambridge University Press. Milind Tambe. 2011. Security and game theory: algorithms deployed systems lessons learned. Cambridge University Press.","DOI":"10.1017\/CBO9780511973031"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_9"},{"key":"e_1_3_2_2_24_1","unstructured":"Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent Proceedings of the 20th International Conference on Machine Learning (ICML-03). 928--936. Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent Proceedings of the 20th International Conference on Machine Learning (ICML-03). 928--936."}],"event":{"name":"EC '18: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Ithaca NY USA","acronym":"EC '18"},"container-title":["Proceedings of the 2018 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219166.3219193","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219166.3219193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T01:05:43Z","timestamp":1673226343000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":24,"alternative-id":["10.1145\/3219166.3219193","10.1145\/3219166"],"URL":"https:\/\/doi.org\/10.1145\/3219166.3219193","relation":{},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}