{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:43:05Z","timestamp":1771623785976,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319131283","type":"print"},{"value":"9783319131290","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13129-0_22","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:08:41Z","timestamp":1417432121000},"page":"277-291","source":"Crossref","is-referenced-by-count":22,"title":["Sampling and Representation Complexity of Revenue Maximization"],"prefix":"10.1007","author":[{"given":"Shaddin","family":"Dughmi","sequence":"first","affiliation":[]},{"given":"Li","family":"Han","sequence":"additional","affiliation":[]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Alaei, S.: Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 512\u2013521 (2011)","DOI":"10.1109\/FOCS.2011.90"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Fu, H., Haghpanah, N., Hartline, J., Malekian, A.: Bayesian optimal auctions via multi-to single-agent reduction. In: ACM Conference on Electronic Commerce, p.\u00a017 (2012)","DOI":"10.1145\/2229012.2229017"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, M.-.F., Blum, A., Hartline, J.D., Mansour, Y.: Mechanism design via machine learning. In: Foundations of Computer Science, pp. 605\u2013614 (2005)","DOI":"10.1109\/SFCS.2005.50"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Briest, P., Chawla, S., Kleinberg, R., Matthew Weinberg, S.: Pricing randomized allocations. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 585\u2013597 (2010)","DOI":"10.1137\/1.9781611973075.49"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C.: Extreme-value theorems for optimal multidimensional pricing. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 522\u2013531 (2011)","DOI":"10.1109\/FOCS.2011.76"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Matthew Weinberg, S.: An algorithmic characterization of multi-dimensional mechanisms. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 459\u2013478 (2012)","DOI":"10.1145\/2213977.2214021"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Matthew Weinberg, S.: Optimal multi-dimensional mechanism design: Reducing revenue to welfare maximization. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 130\u2013139 (2012)","DOI":"10.1109\/FOCS.2012.88"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Cai, Y., Huang, Z.: Simple and nearly optimal multi-item auctions. In: SODA, pp. 564\u2013577 (2013)","DOI":"10.1137\/1.9781611973105.41"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Kleinberg, R.D.: Algorithmic pricing via virtual valuations. In: ACM Conference on Electronic Commerce, pp. 243\u2013251 (2007)","DOI":"10.1145\/1250910.1250946"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 311\u2013320 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Chawla, S., Malec, D.L., Sivan, B.: The power of randomness in bayesian optimal mechanism design. In: Proceedings of the 11th ACM Conference on Electronic Commerce (2010)","DOI":"10.1145\/1807342.1807366"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Matthew Weinberg, S.: Symmetries and optimal multi-dimensional mechanism design. In: ACM Conference on Electronic Commerce, pp. 370\u2013387 (2012)","DOI":"10.1145\/2229012.2229042"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Hart, S., Nisan, N.: The menu-size complexity of auctions. In: ACM Conference on Electronic Commerce, p. 565 (2013)","DOI":"10.1145\/2492002.2482544"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11534273_37","volume-title":"Algorithms and Data Structures","author":"J.D. Hartline","year":"2005","unstructured":"Hartline, J.D., Koltun, V.: Near-optimal pricing in near-linear time. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 422\u2013431. Springer, Heidelberg (2005)"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jet.2005.08.007","volume":"127","author":"A.M. Manelli","year":"2006","unstructured":"Manelli, A.M., Vincent, D.R.: Bundling as an optimal selling mechanism for a multiple-good monopolist. Journal of Economic Theory\u00a0127(1), 1\u201335 (2006)","journal-title":"Journal of Economic Theory"},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0022-0531(88)90135-4","volume":"46","author":"R. Preston McAfee","year":"1988","unstructured":"Preston McAfee, R., McMillan, J.: Multidimensional incentive compatibility and mechanism design. Journal of Economic Theory\u00a046(2), 335\u2013354 (1988)","journal-title":"Journal of Economic Theory"},{"issue":"1","key":"22_CR18","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"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.jet.2003.09.002","volume":"117","author":"J. Thanassoulis","year":"2004","unstructured":"Thanassoulis, J.: Haggling over substitutes. Journal of Economic Theory\u00a0117(2), 217\u2013245 (2004)","journal-title":"Journal of Economic Theory"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13129-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T21:56:00Z","timestamp":1747173360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13129-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131283","9783319131290"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13129-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}