{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:44Z","timestamp":1725456704809},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353109"},{"type":"electronic","value":"9783642353116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_42","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T07:32:28Z","timestamp":1354606348000},"page":"526-531","source":"Crossref","is-referenced-by-count":1,"title":["Lower Bounds on Revenue of Approximately Optimal Auctions"],"prefix":"10.1007","author":[{"given":"Balasubramanian","family":"Sivan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Syrgkanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Tamuz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"42_CR1","first-page":"180","volume":"86","author":"J. Bulow","year":"1996","unstructured":"Bulow, J., Klemperer, P.: Auctions vs negotiations. American Economic Review\u00a086(1), 180\u2013194 (1996)","journal-title":"American Economic Review"},{"key":"42_CR2","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)"},{"doi-asserted-by":"crossref","unstructured":"Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. In: Proceedings of the 11th ACM Conference on Electronic Commerce, EC 2010, pp. 129\u2013138 (2010)","key":"42_CR3","DOI":"10.1145\/1807342.1807364"},{"doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: Proceedings of the 10th ACM Conference on Electronic Commerce, EC 2009, pp. 225\u2013234 (2009)","key":"42_CR4","DOI":"10.1145\/1566374.1566407"},{"doi-asserted-by":"crossref","unstructured":"Paolella, M.: Fundamental probability: A computational approach. John Wiley & Sons (2006)","key":"42_CR5","DOI":"10.1002\/0470035358"},{"key":"42_CR6","first-page":"1204","volume":"arXiv","author":"O. Tamuz","year":"2012","unstructured":"Tamuz, O.: A lower bound on seller revenue in single buyer monopoly auctions. Arxiv preprint arXiv:1204.5551 (2012)","journal-title":"Arxiv preprint"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:58:00Z","timestamp":1557417480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}