{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:18:23Z","timestamp":1725538703410},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046445"},{"type":"electronic","value":"9783642046452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_8","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"72-84","source":"Crossref","is-referenced-by-count":1,"title":["On the Planner\u2019s Loss Due to Lack of Information in Bayesian Mechanism Design"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 R.","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00e1s","family":"Figueroa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Mehta, A.: Efficiency of (revenue-)optimal mechanisms. In: Proceedings of the 10th ACM Conference on Electronic Commerce (EC), pp. 235\u2013242 (2009)","key":"8_CR1","DOI":"10.1145\/1566374.1566408"},{"key":"8_CR2","first-page":"180","volume":"86","author":"J. Bulow","year":"1996","unstructured":"Bulow, J., Klemperer, P.: Auctions Versus Negotiations. American Economic Review\u00a086, 180\u2013194 (1996)","journal-title":"American Economic Review"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF02591893","volume":"26","author":"P. Carstensen","year":"1983","unstructured":"Carstensen, P.: Complexity of some parametric integer and network programming problems. Mathematical Programming\u00a026(1), 64\u201375 (1983)","journal-title":"Mathematical Programming"},{"unstructured":"Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: Proceeding of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 701\u2013709 (2004)","key":"8_CR4"},{"doi-asserted-by":"crossref","unstructured":"Hartline, J., Roughgarden, T.: Optimal Mechanism Design and Money Burning. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 75\u201384 (2008)","key":"8_CR5","DOI":"10.1145\/1374376.1374390"},{"doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: What is an edge worth? In: Proceeding of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 252\u2013259 (2001)","key":"8_CR6","DOI":"10.1109\/SFCS.2001.959899"},{"key":"8_CR7","volume-title":"Introductory Real Analysis","author":"A.N. Kolmogorov","year":"1975","unstructured":"Kolmogorov, A.N., Fomin, S.V.: Introductory Real Analysis. Dover Publications, New York (1975)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01581642","volume":"19","author":"K. Murty","year":"1980","unstructured":"Murty, K.: Computational complexity of parametric linear programming. Mathematical Programming\u00a019, 213\u2013219 (1980)","journal-title":"Mathematical Programming"},{"issue":"1","key":"8_CR9","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":"8_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nissan","year":"2007","unstructured":"Nissan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"8_CR11","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04645-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:09:49Z","timestamp":1619780989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}