{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:10:08Z","timestamp":1742944208381,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_2","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"21-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Buy-Many Mechanisms for\u00a0Many Unit-Demand Buyers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5583-2320","authenticated-orcid":false,"given":"Shuchi","family":"Chawla","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0155-5369","authenticated-orcid":false,"given":"Rojin","family":"Rezvan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4824-3840","authenticated-orcid":false,"given":"Yifeng","family":"Teng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7560-5069","authenticated-orcid":false,"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/120878422","volume":"43","author":"S Alaei","year":"2014","unstructured":"Alaei, S.: Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43(2), 930\u2013972 (2014)","journal-title":"SIAM J. Comput."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Fu, H., Haghpanah, N., Hartline, J.: The simple economics of approximately optimal auctions. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 628\u2013637. IEEE (2013)","DOI":"10.1109\/FOCS.2013.73"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Lucier, B., Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 21\u201330. IEEE (2014)","DOI":"10.1109\/FOCS.2014.11"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jet.2014.04.011","volume":"156","author":"P Briest","year":"2015","unstructured":"Briest, P., Chawla, S., Kleinberg, R., Weinberg, S.M.: Pricing lotteries. J. Econ. Theory 156, 144\u2013174 (2015)","journal-title":"J. Econ. Theory"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cai, Y., Zhao, M.: Simple mechanisms for subadditive buyers via duality. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 170\u2013183 (2017)","DOI":"10.1145\/3055399.3055465"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Kleinberg, R.: Algorithmic pricing via virtual valuations. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 243\u2013251 (2007)","DOI":"10.1145\/1250910.1250946"},{"key":"2_CR7","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 forty-second ACM symposium on Theory of computing, pp. 311\u2013320 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.geb.2012.08.010","volume":"91","author":"S Chawla","year":"2015","unstructured":"Chawla, S., Malec, D., Sivan, B.: The power of randomness in Bayesian optimal mechanism design. Games Econom. Behav. 91, 297\u2013317 (2015)","journal-title":"Games Econom. Behav."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chawla, S., Miller, J.B.: Mechanism design for subadditive agents via an ex ante relaxation. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 579\u2013596 (2016)","DOI":"10.1145\/2940716.2940756"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Chawla, S., Teng, Y., Tzamos, C.: Buy-many mechanisms are not much better than item pricing. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 237\u2013238 (2019)","DOI":"10.1145\/3328526.3329583"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"D\u00fctting, P., Kesselheim, T., Lucier, B.: An o(log log m) prophet inequality for subadditive combinatorial auctions. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 306\u2013317 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00037","DOI":"10.1109\/FOCS46700.2020.00037"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: Online contention resolution schemes. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1014\u20131033. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"2_CR13","unstructured":"Feng, Y., Hartline, J., Li, Y.: Simple mechanisms for non-linear agents. arXiv preprint arXiv:2003.00545 (2020)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Feng, Y., Hartline, J.D.: An end-to-end argument in mechanism design (prior-independent auctions for budgeted agents). In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 404\u2013415. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00046"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Feng, Y., Hartline, J.D., Li, Y.: Optimal auctions vs. anonymous pricing: beyond linear utility. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 885\u2013886 (2019)","DOI":"10.1145\/3328526.3329603"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Feng, Y., Hartline, J.D., Li, Y.: Revelation gap for pricing from samples. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1438\u20131451 (2021)","DOI":"10.1145\/3406325.3451057"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.jet.2019.07.006","volume":"183","author":"S Hart","year":"2019","unstructured":"Hart, S., Nisan, N.: Selling multiple correlated goods: revenue maximization and menu-size complexity. J. Econ. Theory 183, 991\u20131029 (2019)","journal-title":"J. Econ. Theory"},{"key":"2_CR18","unstructured":"Iwasaki, A., et al.: Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms. In: van der Hoek, W., Kaminka, G.A., Lesp\u00e9rance, Y., Luck, M., Sen, S. (eds.) 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, 10\u201314 May 2010, vol. 1\u20133. pp. 633\u2013640. IFAAMAS (2010)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 123\u2013136 (2012)","DOI":"10.1145\/2213977.2213991"},{"issue":"28","key":"2_CR20","doi-asserted-by":"publisher","first-page":"11232","DOI":"10.1073\/pnas.1309533110","volume":"110","author":"X Li","year":"2013","unstructured":"Li, X., Yao, A.C.C.: On revenue maximization for selling multiple independently distributed items. Proc. Nat. Acad. Sci. 110(28), 11232\u201311237 (2013)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"2_CR21","unstructured":"Ma, W., Simchi-Levi, D.: Reaping the benefits of bundling under high production costs. In: Banerjee, A., Fukumizu, K. (eds.) The 24th International Conference on Artificial Intelligence and Statistics, AISTATS 2021, 13\u201315 April 2021, Virtual Event. Proceedings of Machine Learning Research, vol. 130, pp. 1342\u20131350. PMLR (2021)"},{"issue":"3\u20134","key":"2_CR22","first-page":"1","volume":"6","author":"A Rubinstein","year":"2018","unstructured":"Rubinstein, A., Weinberg, S.M.: Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. ACM Trans. Econ. Comput. (TEAC) 6(3\u20134), 1\u201325 (2018)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Yan, Q.: Mechanism design via correlation gap. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 710\u2013719. SIAM (2011)","DOI":"10.1137\/1.9781611973082.56"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: An n-to-1 bidder reduction for multi-item auctions and its applications. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 92\u2013109. SIAM (2014)","DOI":"10.1137\/1.9781611973730.8"},{"issue":"1","key":"2_CR25","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/S0899-8256(03)00045-9","volume":"46","author":"M Yokoo","year":"2004","unstructured":"Yokoo, M., Sakurai, Y., Matsubara, S.: The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. Games Econ. Behav. 46(1), 174\u2013188 (2004)","journal-title":"Games Econ. Behav."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48974-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:03:05Z","timestamp":1703988185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}