{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:18:09Z","timestamp":1775744289100,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031489730","type":"print"},{"value":"9783031489747","type":"electronic"}],"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_27","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"474-491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Auction Design for\u00a0Value Maximizers with\u00a0Budget and\u00a0Return-on-Spend Constraints"],"prefix":"10.1007","author":[{"given":"Pinyan","family":"Lu","sequence":"first","affiliation":[]},{"given":"Chenyang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ruilong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-35389-6_2","volume-title":"Web and Internet Economics","author":"G Aggarwal","year":"2019","unstructured":"Aggarwal, G., Badanidiyuru, A., Mehta, A.: Autobidding with constraints. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 17\u201330. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_2"},{"key":"27_CR2","unstructured":"Babaioff, M., Cole, R., Hartline, J.D., Immorlica, N., Lucier, B.: Non-quasi-linear agents in quasi-linear mechanisms (extended abstract). In: ITCS. LIPIcs, vol. 185, pp. 84:1\u201384:1. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3982\/TE1951","volume":"12","author":"B Baisa","year":"2017","unstructured":"Baisa, B.: Auction design without quasilinear preferences. Theor. Econ. 12(1), 53\u201378 (2017)","journal-title":"Theor. Econ."},{"key":"27_CR4","unstructured":"Balseiro, S.R., Deng, Y., Mao, J., Mirrokni, V.S., Zuo, S.: Robust auction design in the auto-bidding world. In: NeurIPS, pp. 17777\u201317788 (2021)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Balseiro, S.R., Deng, Y., Mao, J., Mirrokni, V.S., Zuo, S.: Optimal mechanisms for value maximizers with budget constraints via target clipping. In: EC, p. 475. ACM (2022)","DOI":"10.2139\/ssrn.4081457"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Balseiro, S.R., Kim, A., Mahdian, M., Mirrokni, V.S.: Budget-constrained incentive compatibility for stationary mechanisms. In: EC, pp. 607\u2013608. ACM (2020)","DOI":"10.1145\/3391403.3399472"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Gravin, N., Lu, P.: Budget feasible mechanism design: from prior-free to Bayesian. In: STOC, pp. 449\u2013458. ACM (2012)","DOI":"10.1145\/2213977.2214020"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J.T., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: EC, pp. 44\u201351. ACM (2005)","DOI":"10.1145\/1064009.1064014"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1287\/moor.2020.1070","volume":"46","author":"I Caragiannis","year":"2021","unstructured":"Caragiannis, I., Voudouris, A.A.: The efficiency of resource allocation mechanisms for budget-constrained users. Math. Oper. Res. 46(2), 503\u2013523 (2021)","journal-title":"Math. Oper. Res."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Cavallo, R., Krishnamurthy, P., Sviridenko, M., Wilkens, C.A.: Sponsored search auctions with rich ads. In: WWW, pp. 43\u201351. ACM (2017)","DOI":"10.1145\/3038912.3052703"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Chawla, S., Malec, D.L., Malekian, A.: Bayesian mechanism design for budget-constrained agents. In: EC, pp. 253\u2013262. ACM (2011)","DOI":"10.1145\/1993574.1993613"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1006\/jeth.1999.2639","volume":"92","author":"Y Che","year":"2000","unstructured":"Che, Y., Gale, I.L.: The optimal mechanism for selling to a budget-constrained buyer. J. Econ. Theory 92(2), 198\u2013233 (2000)","journal-title":"J. Econ. Theory"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., Lu, P.: On the approximability of budget feasible mechanisms. In: SODA, pp. 685\u2013699. SIAM (2011)","DOI":"10.1137\/1.9781611973082.54"},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1287\/moor.2013.0625","volume":"39","author":"N Chen","year":"2014","unstructured":"Chen, N., Gravin, N., Lu, P.: Truthful generalized assignments via stable matching. Math. Oper. Res. 39(3), 722\u2013736 (2014)","journal-title":"Math. Oper. Res."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Deng, Y., Mao, J., Mirrokni, V.S., Zuo, S.: Towards efficient auctions in an auto-bidding world. In: WWW, pp. 3965\u20133973. ACM\/IW3C2 (2021)","DOI":"10.1145\/3442381.3450052"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Weinberg, S.M.: The optimal mechanism for selling to a budget constrained buyer: The general case. In: EC, pp. 39\u201340. ACM (2017)","DOI":"10.1145\/3033274.3085132"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. In: FOCS, pp. 260\u2013269. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.39"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-662-43948-7_33","volume-title":"Automata, Languages, and Programming","author":"S Dobzinski","year":"2014","unstructured":"Dobzinski, S., Leme, R.P.: Efficiency guarantees in auctions with budgets. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 392\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_33"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Jalaly, P., Tardos, \u00c9.: Simple and efficient budget feasible mechanisms for monotone submodular valuations. ACM Trans. Econ. Comput. 9(1), 4:1\u20134:20 (2021)","DOI":"10.1145\/3434421"},{"issue":"5","key":"27_CR20","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1007\/s00453-020-00781-9","volume":"83","author":"S Leonardi","year":"2021","unstructured":"Leonardi, S., Monaco, G., Sankowski, P., Zhang, Q.: Budget feasible mechanisms on matroids. Algorithmica 83(5), 1222\u20131237 (2021)","journal-title":"Algorithmica"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Lu, P., Xiao, T.: Improved efficiency guarantees in auctions with budgets. In: EC, pp. 397\u2013413. ACM (2015)","DOI":"10.1145\/2764468.2764500"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-66700-3_4","volume-title":"Algorithmic Game Theory","author":"P Lu","year":"2017","unstructured":"Lu, P., Xiao, T.: Liquid welfare maximization in auctions with multiple items. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 41\u201352. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_4"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Lv, H., et al.: Utility maximizer or value maximizer: mechanism design for mixed bidders in online advertising. In: AAAI 2023 (2023)","DOI":"10.1609\/aaai.v37i5.25718"},{"issue":"1","key":"27_CR24","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"27_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35(1\u20132), 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"key":"27_CR26","volume-title":"Algorithmic Game Theory","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"27_CR27","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.jet.2013.09.015","volume":"150","author":"MM Pai","year":"2014","unstructured":"Pai, M.M., Vohra, R.: Optimal auctions with financially constrained buyers. J. Econ. Theory 150, 383\u2013425 (2014)","journal-title":"J. Econ. Theory"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: FOCS, pp. 765\u2013774. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.78"},{"key":"27_CR29","unstructured":"Zhou, Y., Serizawa, S.: Multi-object auction design beyond quasi-linearity: leading examples. Technical report, ISER Discussion Paper (2021)"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:05:20Z","timestamp":1703988320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}