{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T09:37:11Z","timestamp":1771061831760,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google","award":["Focused Research Award"],"award-info":[{"award-number":["Focused Research Award"]}]},{"name":"Simons","award":["Junior Fellowship"],"award-info":[{"award-number":["Junior Fellowship"]}]},{"name":"NSF","award":["CNS-1065060, CCF- 1101389, CAREER"],"award-info":[{"award-number":["CNS-1065060, CCF- 1101389, CAREER"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897579","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T09:04:07Z","timestamp":1465549447000},"page":"949-962","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Watch and learn: optimizing from revealed preferences feedback"],"prefix":"10.1145","author":[{"given":"Aaron","family":"Roth","sequence":"first","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Ullman","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei Steven","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2887007.2887114"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559152"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.002"},{"key":"e_1_3_2_1_4_1","first-page":"353","volume-title":"Web and Internet Economics","author":"Balcan M.-F.","unstructured":"M.-F. Balcan, A. Daniely, R. Mehta, R. Urner, and V. V. Vazirani. Learning economic parameters from revealed preferences. In Web and Internet Economics, pages 338\u2013353. Springer, 2014."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134712"},{"key":"e_1_3_2_1_6_1","first-page":"265","volume-title":"Proceedings of The 28th Conference on Learning Theory, COLT 2015","author":"Belloni A.","year":"2015","unstructured":"A. Belloni, T. Liang, H. Narayanan, and A. Rakhlin. Escaping the local minima via simulated annealing: Optimization of approximately convex functions. In Proceedings of The 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015, pages 240\u2013265, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.12"},{"key":"e_1_3_2_1_8_1","first-page":"1834","volume-title":"Advances in Neural Information Processing Systems","author":"Blum A.","year":"2014","unstructured":"A. Blum, N. Haghtalab, and A. D. Procaccia. Learning optimal commitment to overcome insecurity. In Advances in Neural Information Processing Systems, pages 1826\u20131834, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2887007.2887118"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/050641181"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602881"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_3_2_1_13_1","volume-title":"Bilevel programming: A survey. 4OR, 3(2):87\u2013107","author":"Colson B.","year":"2005","unstructured":"B. Colson, P. Marcotte, and G. Savard. Bilevel programming: A survey. 4OR, 3(2):87\u2013107, 2005."},{"key":"e_1_3_2_1_14_1","first-page":"291","volume-title":"Web and Internet Economics","author":"Dughmi S.","unstructured":"S. Dughmi, L. Han, and N. Nisan. Sampling and representation complexity of revenue maximization. In Web and Internet Economics, pages 277\u2013291. Springer, 2014."},{"key":"e_1_3_2_1_15_1","volume-title":"Making the most of your samples. arXiv preprint arXiv:1407.2479","author":"Huang Z.","year":"2014","unstructured":"Z. Huang, Y. Mansour, and T. Roughgarden. Making the most of your samples. arXiv preprint arXiv:1407.2479, 2014."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2898607.2898737"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_23"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.08.004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_20_1","volume-title":"The pseudo-dimension of near-optimal auctions. arXiv preprint arXiv:1506.03684","author":"Morgenstern J.","year":"2015","unstructured":"J. Morgenstern and T. Roughgarden. The pseudo-dimension of near-optimal auctions. arXiv preprint arXiv:1506.03684, 2015."},{"key":"e_1_3_2_1_21_1","volume-title":"Watch and learn: Optimizing from revealed preferences feedback. CoRR, abs\/1504.01033","author":"Roth A.","year":"2015","unstructured":"A. Roth, J. Ullman, and Z. S. Wu. Watch and learn: Optimizing from revealed preferences feedback. CoRR, abs\/1504.01033, 2015."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1958.8.171"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_9"},{"key":"e_1_3_2_1_24_1","unstructured":"A Routing Game Where Social Cost is Not Convex in The Tolls"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897579","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:41:42Z","timestamp":1763458902000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":24,"alternative-id":["10.1145\/2897518.2897579","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897579","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}