{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:33Z","timestamp":1763468073624,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214018","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"427-434","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Prior-free auctions with ordered bidders"],"prefix":"10.1145","author":[{"given":"Stefano","family":"Leonardi","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109677"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566402"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090257"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.002"},{"key":"e_1_3_2_2_5_1","first-page":"1156","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Blum A.","year":"2005","unstructured":"A. Blum and J. D. Hartline . Near-optimal online auctions . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1156 -- 1163 , 2005 . A. Blum and J. D. Hartline. Near-optimal online auctions. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1156--1163, 2005."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.11"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566381"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_11"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807364"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779932"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2006.02.003"},{"key":"e_1_3_2_2_13_1","first-page":"331","volume-title":"N. Nisan, T. Roughgarden, \u00c9","author":"Hartline J. D.","year":"2007","unstructured":"J. D. Hartline and A. Karlin . Profit maximization in mechanism design . In N. Nisan, T. Roughgarden, \u00c9 . Tardos, and V. V. Vazirani, editors, Algorithmic Game Theory, chapter 13, pages 331 -- 362 . Cambridge University Press , 2007 . J. D. Hartline and A. Karlin. Profit maximization in mechanism design. In N. Nisan, T. Roughgarden, \u00c9. Tardos, and V. V. Vazirani, editors, Algorithmic Game Theory, chapter 13, pages 331--362. Cambridge University Press, 2007."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374390"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993612"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973006.10"},{"key":"e_1_3_2_2_18_1","volume-title":"Uncertainty in mechanism design. Submitted","author":"Lopomo G.","year":"2009","unstructured":"G. Lopomo , L. Rigotti , and C. Shannon . Uncertainty in mechanism design. Submitted , 2009 . G. Lopomo, L. Rigotti, and C. Shannon. Uncertainty in mechanism design. Submitted, 2009."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_2_20_1","first-page":"209","volume-title":"N. Nisan, T. Roughgarden, \u00c9","author":"Nisan N.","year":"2007","unstructured":"N. Nisan . Introduction to mechanism design (for computer scientists) . In N. Nisan, T. Roughgarden, \u00c9 . Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 9, pages 209 -- 241 . Cambridge University Press , 2007 . N. Nisan. Introduction to mechanism design (for computer scientists). In N. Nisan, T. Roughgarden, \u00c9. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 9, pages 209--241. Cambridge University Press, 2007."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214018","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":19,"alternative-id":["10.1145\/2213977.2214018","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214018","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}