{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T05:58:35Z","timestamp":1778651915457,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315848","type":"print"},{"value":"9783642315855","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_44","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"488-499","source":"Crossref","is-referenced-by-count":12,"title":["Efficiency-Revenue Trade-Offs in Auctions"],"prefix":"10.1007","author":[{"given":"Ilias","family":"Diakonikolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Pierrakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Singer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Abhishek, V., Hajek, B.E.: Efficiency loss in revenue optimal auctions. In: CDC (2010)","DOI":"10.1109\/CDC.2010.5717950"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Mehta, A.: Efficiency of (revenue-)optimal mechanisms. In: EC (2009)","DOI":"10.1145\/1566374.1566408"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Armstrong, M.: Optimal multi-object auctions. Review of Economic Studies\u00a067(3), 455\u2013481","DOI":"10.1111\/1467-937X.00139"},{"issue":"1","key":"44_CR4","first-page":"180","volume":"86","author":"J. Bulow","year":"1996","unstructured":"Bulow, J., Klemperer, P.: Auctions versus negotiations. American Economic Review\u00a086(1), 180\u2013194 (1996)","journal-title":"American Economic Review"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondrak, J., Zenklusen, R.: Multi-budgeted matchings and matroid intersection via dependent rounding. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.82"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Diakonikolas, I., Yannakakis, M.: How good is the chord algorithm? In: SODA (2010)","DOI":"10.1137\/1.9781611973075.79"},{"key":"44_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-25510-6_10","volume-title":"Internet and Network Economics","author":"C. Daskalakis","year":"2011","unstructured":"Daskalakis, C., Pierrakos, G.: Simple, Optimal and Efficient Auctions. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol.\u00a07090, pp. 109\u2013121. Springer, Heidelberg (2011)"},{"key":"44_CR8","unstructured":"Diakonikolas, I.: Approximation of Multiobjective Optimization Problems. PhD thesis, Columbia University (2010)"},{"key":"44_CR9","unstructured":"Diakonikolas, I., Yannakakis, M.: Succinct Approximate Convex Pareto Curves. In: SODA (2008)"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1137\/080724514","volume":"39","author":"I. Diakonikolas","year":"2009","unstructured":"Diakonikolas, I., Yannakakis, M.: Small approximate pareto sets for biobjective shortest paths and other problems. SIAM J. Comput.\u00a039, 1340\u20131371 (2009)","journal-title":"SIAM J. Comput."},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Dobzinski, S.: An impossibility result for truthful combinatorial auctions with submodular valuations. In: STOC (2011)","DOI":"10.1145\/1993636.1993656"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Fu, H., Kleinberg, R.D.: Optimal auctions with correlated bidders are easy. In: STOC (2011)","DOI":"10.1145\/1993636.1993655"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Roughgarden, T., Yan, Q.: From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. In: STOC (2011)","DOI":"10.1145\/1993636.1993657"},{"key":"44_CR14","unstructured":"Ehrgott, M.: Multicriteria optimization. Springer (2005)"},{"issue":"3","key":"44_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1983","unstructured":"Galperin, H., Wigderson, A.: Succinct representations of graphs. Information and Control\u00a056(3), 183\u2013198 (1983)","journal-title":"Information and Control"},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Krysta, P., Leonardi, S., Ventre, C.: Utilitarian mechanism design for multi-objective optimization. In: SODA (2010)","DOI":"10.1137\/1.9781611973075.48"},{"key":"44_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-04128-0_9","volume-title":"Algorithms - ESA 2009","author":"F. Grandoni","year":"2009","unstructured":"Grandoni, F., Ravi, R., Singh, M.: Iterative Rounding for Multi-Objective Optimization Problems. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 95\u2013106. Springer, Heidelberg (2009)"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Climacao, E.J.: Multicriteria Analysis. Springer (1997)","DOI":"10.1007\/978-3-642-60667-0"},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Likhodedov, A., Sandholm, T.: Mechanism for optimally trading off revenue and efficiency in multi-unit auctions. In: EC (2003)","DOI":"10.1145\/779928.779964"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluwer (1999)","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: STOC (1987)","DOI":"10.1145\/28395.383347"},{"key":"44_CR22","doi-asserted-by":"crossref","unstructured":"Myerson, R.B.: Optimal auction design. Mathematics of Operations Research 6, 58\u201373","DOI":"10.1287\/moor.6.1.58"},{"issue":"2","key":"44_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"R.B. Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. Journal of Economic Theory\u00a029(2), 265\u2013281 (1983)","journal-title":"Journal of Economic Theory"},{"issue":"2","key":"44_CR24","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0899-8256(03)00005-8","volume":"43","author":"Z. Neeman","year":"2003","unstructured":"Neeman, Z.: The effectiveness of english auctions. Games and Economic Behavior\u00a043(2), 214\u2013238 (2003)","journal-title":"Games and Economic Behavior"},{"key":"44_CR25","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"44_CR26","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Pierrakos, G.: On optimal single-item auctions. In: STOC (2011)","DOI":"10.1145\/1993636.1993654"},{"issue":"3","key":"44_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","volume":"71","author":"C.H. Papadimitriou","year":"1986","unstructured":"Papadimitriou, C.H., Yannakakis, M.: A note on succinct representations of graphs. Information and Control\u00a071(3), 181\u2013185 (1986)","journal-title":"Information and Control"},{"key":"44_CR28","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: FOCS (2000)"},{"key":"44_CR29","unstructured":"Roughgarden, T., Sundararajan, M.: Is efficiency expensive? In: 3rd Workshop on Sponsored Search (2007)"},{"key":"44_CR30","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.tcs.2005.09.022","volume":"348","author":"S. Vassilvitskii","year":"2005","unstructured":"Vassilvitskii, S., Yannakakis, M.: Efficiently computing succinct trade-off curves. Theoretical Computer Science\u00a0348, 334\u2013356 (2005)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:13:41Z","timestamp":1620130421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}