{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:39:47Z","timestamp":1763458787259,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1524062"],"award-info":[{"award-number":["CCF-1524062"]}],"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":[[2016,7,21]]},"DOI":"10.1145\/2940716.2940792","type":"proceedings-article","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T11:20:09Z","timestamp":1469100009000},"page":"601-616","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Minimizing Regret with Multiple Reserves"],"prefix":"10.1145","author":[{"given":"Tim","family":"Roughgarden","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua R.","family":"Wang","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.92"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/554131"},{"key":"e_1_3_2_1_3_1","unstructured":"S. Athey and D. Nekipelov. 2012. A Structural Model of Sponsored Search Advertising Auctions. (2012).Working paper."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070597"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627903"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"N. Cesa-Bianchi and G. Lugosi. 2006. Prediction Learning and Games. Cambridge University Press.","DOI":"10.5555\/1137817"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.07.003"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_3_2_1_10_1","unstructured":"Peter Cramton Hector Lopez David Malec and Pacharasut Sujarittanonta. 2015. Design of the Reverse Auction in the Broadcast Incentive Auction. (2015).An expert report in response to Comment Public Notice FCC 14 -191."},{"key":"e_1_3_2_1_11_1","volume-title":"Envy is Easy. (December","author":"Daskalakis Constantinos","year":"2015","unstructured":"Constantinos Daskalakis and Vasilis Syrgkanis. 2015. Learning in Auctions: Regret is Hard, Envy is Easy. (December 2015).arXiv 1511.01411."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Nikhil R. Devanur Zhiyi Huang and Christos-Alexandros Psomas. 2016. The Sample Complexity of Auctions with Side Information. (2016).To appear in STOC'16. 10.1145\/2897518.2897553","DOI":"10.1145\/2897518.2897553"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807364"},{"key":"e_1_3_2_1_14_1","volume-title":"Contributions to the Theory of Games 3, 97--139","author":"Hannan James","year":"1957","unstructured":"James Hannan. 1957.Approximation to Bayes risk in repeated play. Contributions to the Theory of Games 3, 97--139 (1957), 2."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764475"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/070701704"},{"volume-title":"Learning Theory and Kernel Machines","author":"Kalai Adam","key":"e_1_3_2_1_18_1","unstructured":"Adam Kalai and Santosh Vempala. 2003.Efficient algorithms for online decision problems. In Learning Theory and Kernel Machines. Springer, 26--40."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946352"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of The 31st Intl. Conf. on Machine Learning. 262--270","author":"Medina Andres Munoz","year":"2014","unstructured":"Andres Munoz Medina and Mehryar Mohri. 2014.Learning Theory and Algorithms for revenue optimization in second price auctions with reserve. In Proceedings of The 31st Intl. Conf. on Machine Learning. 262--270."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Jamie H Morgenstern and Tim Roughgarden. 2015.On the Pseudo-Dimension of Nearly Optimal Auctions. In Advances in Neural Information Processing Systems. 136--144.","DOI":"10.5555\/2969239.2969255"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"R. Paes Leme M. P\u00e1l and S. Vassilvitskii. 2016. A Field Guide to Personalized Reserve Prices. (2016).To appear in WWW'16. 10.1145\/2872427.2883071","DOI":"10.1145\/2872427.2883071"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62233"},{"volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"Schrijver Alexander","key":"e_1_3_2_1_25_1","unstructured":"Alexander Schrijver. 2003. Combinatorial optimization: polyhedra and efficiency. Vol. 24. Springer Science & Business Media."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.696327"}],"event":{"name":"EC '16: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Maastricht The Netherlands","acronym":"EC '16"},"container-title":["Proceedings of the 2016 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940716.2940792","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940716.2940792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:35:02Z","timestamp":1763458502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,21]]},"references-count":26,"alternative-id":["10.1145\/2940716.2940792","10.1145\/2940716"],"URL":"https:\/\/doi.org\/10.1145\/2940716.2940792","relation":{},"subject":[],"published":{"date-parts":[[2016,7,21]]},"assertion":[{"value":"2016-07-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}