{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:53:41Z","timestamp":1743058421053,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_24","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"277-288","source":"Crossref","is-referenced-by-count":1,"title":["Limitations of Deterministic Auction Design for Correlated Bidders"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Kyropoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 687\u2013696 (2008)","DOI":"10.1109\/FOCS.2008.47"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-25510-6_6","volume-title":"Internet and Network Economics","author":"X. Chen","year":"2011","unstructured":"Chen, X., Hu, G., Lu, P., Wang, L.: On the approximation ratio of k-lookahead auction. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) Internet and Network Economics. LNCS, vol.\u00a07090, pp. 61\u201371. Springer, Heidelberg (2011)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Constantin, F., Ito, T., Parkes, D.C.: Online Auctions for Bidders with Interdependent Values. In: Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 738\u2013740 (2007)","DOI":"10.1145\/1329125.1329260"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.2307\/1911240","volume":"53","author":"J. Cr\u00e9mer","year":"1985","unstructured":"Cr\u00e9mer, J., McLean, R.: Optimal selling strategies under uncertainty for a discriminating monopolist when demands are interdependent. Econometrica\u00a053(2), 345\u2013361 (1985)","journal-title":"Econometrica"},{"issue":"6","key":"24_CR5","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.2307\/1913096","volume":"56","author":"J. Cr\u00e9mer","year":"1988","unstructured":"Cr\u00e9mer, J., McLean, R.: Full extraction of the surplus in bayesian and dominant strategy auctions. Econometrica\u00a056(6), 1247\u20131257 (1988)","journal-title":"Econometrica"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-31585-5_44","volume-title":"Automata, Languages, and Programming","author":"I. Diakonikolas","year":"2012","unstructured":"Diakonikolas, I., Papadimitriou, C., Pierrakos, G., Singer, Y.: Efficiency-revenue trade-offs in auctions. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 488\u2013499. Springer, Heidelberg (2012)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Fu, H., Kleinberg, R.: Optimal auctions with correlated bidders are easy. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC), pp. 129\u2013138 (2011)","DOI":"10.1145\/1993636.1993655"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.jet.2004.06.005","volume":"125","author":"P. Es\u00f6","year":"2005","unstructured":"Es\u00f6, P.: An optimal auction with correlated values and risk aversion. Journal of Economic Theory\u00a0125(1), 78\u201389 (2005)","journal-title":"Journal of Economic Theory"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. Journal of the ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of the ACM"},{"key":"24_CR10","unstructured":"Krishna, V.: Auction Theory. Academic Press (2009)"},{"issue":"438","key":"24_CR11","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.2307\/2235520","volume":"106","author":"D. Levin","year":"1996","unstructured":"Levin, D., Smith, J.: Optimal Reservation Prices in Auctions. The Economic Journal\u00a0106(438), 1271\u20131283 (1996)","journal-title":"The Economic Journal"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Maskin, E.: Auctions and efficiency. In: Dewatripont, M., Hansen, L.P., Turnovsky, S.J. (eds.) Advances in Economics and Econometrics: Theory and Applications, Eighth World Congress (Econometric Society Monographs), vol.\u00a03, pp. 1\u201324 (2003)","DOI":"10.1017\/CBO9780511610240.002"},{"issue":"5","key":"24_CR13","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.2307\/1911865","volume":"50","author":"P. Milgrom","year":"1982","unstructured":"Milgrom, P., Weber, R.: A theory of auctions and competitive bidding. Econometrica\u00a050(5), 1098\u20131122 (1982)","journal-title":"Econometrica"},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06(1), 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"24_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"24_CR16","unstructured":"Papadimitriou, C., Pierrakos, G.: Optimal deterministic auctions with correlated priors. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC), pp. 119\u2013128 (2011)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Ronen, A.: On approximating optimal auctions. In: Proceedings of the 3rd ACM Conference on Electronic Commerce (EC), pp. 11\u201317 (2001)","DOI":"10.1145\/501158.501160"},{"key":"24_CR18","unstructured":"Ronen, A., Saberi, A.: On the hardness of optimal auctions. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS), pp. 396\u2013405 (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T15:00:21Z","timestamp":1680793221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}