{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:40Z","timestamp":1750306960161,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482606","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"767-784","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal and near-optimal mechanism design with interdependent values"],"prefix":"10.1145","author":[{"given":"Tim","family":"Roughgarden","sequence":"first","affiliation":[{"name":"Stanford, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inbal","family":"Talgam-Cohen","sequence":"additional","affiliation":[{"name":"Stanford, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Alon N. and Spencer J. H. 2008. The Probabilistic Method. Wiley.  Alon N. and Spencer J. H. 2008. The Probabilistic Method. Wiley.","DOI":"10.1002\/9780470277331"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2005.00638.x"},{"key":"e_1_3_2_1_3_1","first-page":"77","article-title":"Multiple unit auctions of an indivisible good","volume":"8","author":"Branco F.","year":"1996","unstructured":"Branco , F. 1996 . Multiple unit auctions of an indivisible good . Economic Theory 8 , 77 -- 101 . Branco, F. 1996. Multiple unit auctions of an indivisible good. Economic Theory 8, 77--101.","journal-title":"Economic Theory"},{"key":"e_1_3_2_1_4_1","first-page":"180","article-title":"Auctions versus negotiations","volume":"86","author":"Bulow J.","year":"1996","unstructured":"Bulow , J. and Klemperer , P. 1996 . Auctions versus negotiations . American Economic Review 86 , 1, 180 -- 194 . Bulow, J. and Klemperer, P. 1996. Auctions versus negotiations. American Economic Review 86, 1, 180--194.","journal-title":"American Economic Review"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.88"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_6"},{"key":"e_1_3_2_1_7_1","unstructured":"Chung K. and Ely J. C. 2006. Ex-post incentive compatible mechanism design. Manuscript.  Chung K. and Ely J. C. 2006. Ex-post incentive compatible mechanism design. Manuscript."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/1911240"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/1913096"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Csap\u00f3 G. and M\u00fcller R. 2013. Optimal mechanism design for the private supply of a public good. To appear in phGames and Economic Behavior.  Csap\u00f3 G. and M\u00fcller R. 2013. Optimal mechanism design for the private supply of a public good. To appear in phGames and Economic Behavior.","DOI":"10.1016\/j.geb.2013.03.014"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOAS344"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807364"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Dobzinski S. Fu H. and Kleinberg R. 2011. Optimal auctions with correlated bidders are easy.  Dobzinski S. Fu H. and Kleinberg R. 2011. Optimal auctions with correlated bidders are easy.","DOI":"10.1145\/1993636.1993655"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2006.02.003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Hartline J. 2012. Approximation in economic design. Book manuscript.  Hartline J. 2012. Approximation in economic design. Book manuscript.","DOI":"10.1257\/aer.102.3.330"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2006.00675.x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0014-2921(97)00123-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-6419.00083"},{"volume-title":"Auction Theory","author":"Krishna V.","key":"e_1_3_2_1_20_1","unstructured":"Krishna , V. 2002. Auction Theory . Academic Press . Krishna, V. 2002. Auction Theory. Academic Press."},{"volume-title":"Auction Theory","author":"Krishna V.","key":"e_1_3_2_1_21_1","unstructured":"Krishna , V. 2010. Auction Theory Second Ed. Academic Press . Krishna, V. 2010. Auction Theory Second Ed. Academic Press."},{"volume-title":"Proc. 14th IEEE INFOCOM Conference.","author":"Lazar A.","key":"e_1_3_2_1_22_1","unstructured":"Lazar , A. , Orda , A. , and Pendarakis , D . 1995. Virtual path bandwidth allocation in multi-user networks . In Proc. 14th IEEE INFOCOM Conference. Lazar, A., Orda, A., and Pendarakis, D. 1995. Virtual path bandwidth allocation in multi-user networks. In Proc. 14th IEEE INFOCOM Conference."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482580"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.2000.0817"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/2951601"},{"volume-title":"Putting Auction Theory to Work","author":"Milgrom P.","key":"e_1_3_2_1_26_1","unstructured":"Milgrom , P. 2004. Putting Auction Theory to Work . Cambridge University Press . Milgrom, P. 2004. Putting Auction Theory to Work. Cambridge University Press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.2307\/1911865"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0899-8256(03)00005-8"},{"volume-title":"Algorithmic Game Theory, N. Nisan, T. Roughgarden, \u00c9","author":"Nisan N.","key":"e_1_3_2_1_30_1","unstructured":"Nisan , N. 2007. Introduction to mechanism design (for computer scientists) . In Algorithmic Game Theory, N. Nisan, T. Roughgarden, \u00c9 . Tardos, and V. Vazirani, Eds. Cambridge University Press , Chapter 9, 209--241. Nisan, N. 2007. Introduction to mechanism design (for computer scientists). In Algorithmic Game Theory, N. Nisan, T. Roughgarden, \u00c9. Tardos, and V. Vazirani, Eds. Cambridge University Press, Chapter 9, 209--241."},{"volume-title":"Matroid Theory","author":"Oxley J. G.","key":"e_1_3_2_1_31_1","unstructured":"Oxley , J. G. 1992. Matroid Theory . Oxford . Oxley, J. G. 1992. Matroid Theory. Oxford."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Papadimitriou C. and Pierrakos G. 2011. On optimal single-item auctions.  Papadimitriou C. and Pierrakos G. 2011. On optimal single-item auctions.","DOI":"10.1145\/1993636.1993654"},{"key":"e_1_3_2_1_33_1","first-page":"381","article-title":"Optimal auctions","volume":"71","author":"Riley J.","year":"1981","unstructured":"Riley , J. and Samuelson , W. 1981 . Optimal auctions . American Economic Review 71 , 381 -- 392 . Riley, J. and Samuelson, W. 1981. Optimal auctions. American Economic Review 71, 381--92.","journal-title":"American Economic Review"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501160"},{"volume-title":"Proc. 43rd IEEE Symp. on Foundations of Computer Science (FOCS).","author":"Ronen A.","key":"e_1_3_2_1_35_1","unstructured":"Ronen , A. and Saberi , A . 2002. On the hardness of optimal auctions . In Proc. 43rd IEEE Symp. on Foundations of Computer Science (FOCS). Ronen, A. and Saberi, A. 2002. On the hardness of optimal auctions. In Proc. 43rd IEEE Symp. on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322156963"},{"key":"e_1_3_2_1_37_1","unstructured":"Ulk12 \u00dclk\u00fc L. 2012. Optimal combinatorial mechanism design. To appear in phEconomic Theory.  Ulk12 \u00dclk\u00fc L. 2012. Optimal combinatorial mechanism design. To appear in phEconomic Theory."},{"key":"e_1_3_2_1_38_1","volume-title":"Mechanism Design: A Linear Programming Approach","author":"Vohra R. V.","year":"2011","unstructured":"Vohra , R. V. 2011 . Mechanism Design: A Linear Programming Approach (Econometric Society Monographs). Cambridge University Press . Vohra, R. V. 2011. Mechanism Design: A Linear Programming Approach (Econometric Society Monographs). Cambridge University Press."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.2307\/2296904"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.15.7.446"}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":40,"alternative-id":["10.1145\/2492002.2482606","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482606","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}