{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:45:29Z","timestamp":1777614329179,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319666990","type":"print"},{"value":"9783319667003","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_4","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"41-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Liquid Welfare Maximization in Auctions with Multiple Items"],"prefix":"10.1007","author":[{"given":"Pinyan","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abrams, Z.: Revenue maximization when bidders have budgets. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 1074\u20131082. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1145\/1109557.1109676"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Anari, N., Goel, G., Nikzad, A.: Mechanism design for crowdsourcing: an optimal 1-1\/e competitive budget-feasible mechanism for large markets. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 266\u2013275. IEEE (2014)","DOI":"10.1109\/FOCS.2014.36"},{"key":"4_CR3","unstructured":"Azar, Y., Feldman, M., Gravin, M., Roytman, A.: Liquid price of anarchy. arXiv preprint arXiv:1511.01132 (2015)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Hartline, J.D., Mansour, Y.: Mechanism design via machine learning. In 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 605\u2013614. IEEE (2005)","DOI":"10.1109\/SFCS.2005.50"},{"issue":"8","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.jcss.2007.08.002","volume":"74","author":"M-F Balcan","year":"2008","unstructured":"Balcan, M.-F., Blum, A., Hartline, J.D., Mansour, Y.: Reducing mechanism design to algorithm design via machine learning. J. Comput. Syst. Sci. 74(8), 1245\u20131270 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR6","unstructured":"Balcan, M.-F., Devanur, N., Hartline, J.D., Talwar, K.: Random sampling auctions for limited supply. Manuscript (2007, submitted)"},{"key":"4_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 (2012)","DOI":"10.1145\/2213977.2214020"},{"key":"4_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 (2005)","DOI":"10.1145\/1064009.1064014"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s00224-016-9674-4","volume":"59","author":"I Caragiannis","year":"2016","unstructured":"Caragiannis, I., Voudouris, A.A.: Welfare guarantees for proportional allocations. Theory Comput. Syst. 59(4), 581\u2013599 (2016)","journal-title":"Theory Comput. Syst."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Chawla, S., Malec, D.L., Malekian, A.: Bayesian mechanism design for budget-constrained agents. In: EC, pp. 253\u2013262 (2011)","DOI":"10.1145\/1993574.1993613"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., Lu, P.: On the approximability of budget feasible mechanisms. In: SODA, pp. 685\u2013699 (2011)","DOI":"10.1137\/1.9781611973082.54"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1287\/moor.2013.0625","volume":"39","author":"N Chen","year":"2013","unstructured":"Chen, N., Gravin, N., Lu, P.: Truthful generalized assignments via stable matching. Math. Oper. Res. 39(3), 722\u2013736 (2013)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/s00224-016-9701-5","volume":"59","author":"G Christodoulou","year":"2016","unstructured":"Christodoulou, G., Sgouritsa, A., Tang, B.: On the efficiency of the proportional allocation mechanism for divisible resources. Theory Comput. Syst. 59(4), 600\u2013618 (2016)","journal-title":"Theory Comput. Syst."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Ha, B.Q., Hartline, D.: Prior-free auctions for budgeted agents. In: EC, pp. 287\u2013304 (2013)","DOI":"10.1145\/2482540.2482554"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.geb.2011.08.003","volume":"74","author":"S Dobzinski","year":"2012","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. Games Econ. Behav. 74(2), 486\u2013503 (2012)","journal-title":"Games Econ. Behav."},{"key":"4_CR16","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). doi:10.1007\/978-3-662-43948-7_33"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Papadimitriou, C.H., Singer, Y.: Mechanisms for complement-free procurement. In: EC, pp. 273\u2013282 (2011)","DOI":"10.1145\/1993574.1993615"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Eden, A., Feldman, M., Fiat, A., Leonardi, S.: Lottery pricing equilibria. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 401\u2013418. ACM (2016)","DOI":"10.1145\/2940716.2940742"},{"key":"4_CR19","unstructured":"Eden, A., Feldman, M., Vardi, A.: Truthful secretaries with budgets. arXiv preprint arXiv:1504.03625 (2015)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Leonardi, S., Sankowski, P.: Revenue maximizing envy-free multi-unit auctions with budgets. In: EC, pp. 532\u2013549 (2012)","DOI":"10.1145\/2229012.2229052"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Feldman, M., Immorlica, M., Lucier, B., Roughgarden, T., Syrgkanis, V.: The price of anarchy in large games. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, pp. 963\u2013976. ACM (2016)","DOI":"10.1145\/2897518.2897580"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Fiat, A., Leonardi, S., Saia, J., Sankowski, P.: Single valued combinatorial auctions with budgets. In: EC, pp. 223\u2013232 (2011)","DOI":"10.1145\/1993574.1993609"},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.geb.2006.02.003","volume":"55","author":"AV Goldberg","year":"2006","unstructured":"Goldberg, A.V., Hartline, J.D., Karlin, A.R., Saks, M., Wright, A.: Competitive auctions. Games Econ. Behav. 55(2), 242\u2013269 (2006)","journal-title":"Games Econ. Behav."},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-39212-2_50","volume-title":"Automata, Languages, and Programming","author":"N Gravin","year":"2013","unstructured":"Gravin, N., Lu, P.: Competitive auctions for markets with positive externalities. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 569\u2013580. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39212-2_50"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Lu, P., Xiao, T.: Improved efficiency guarantees in auctions with budgets. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 397\u2013413. ACM (2015)","DOI":"10.1145\/2764468.2764500"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: FOCS, pp. 765\u2013774 (2010)","DOI":"10.1109\/FOCS.2010.78"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, \u00c9.: Composable and efficient mechanisms. In: STOC, pp. 211\u2013220 (2013)","DOI":"10.1145\/2488608.2488635"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T23:26:34Z","timestamp":1750807594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}