{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:54:38Z","timestamp":1764276878747,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"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_1","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Liquid Price of Anarchy"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[]},{"given":"Alan","family":"Roytman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Anari, N., Goel, G., Nikzad, A.: Mechanism design for crowdsourcing: an optimal 1\u20131\/e competitive budget-feasible mechanism for large markets. In: FOCS, pp. 266\u2013275 (2014)","DOI":"10.1109\/FOCS.2014.36"},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94(5), 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"1_CR3","unstructured":"Azar, Y., Feldman, M., Gravin, N., Roytman, A.: Liquid price of anarchy. CoRR abs\/1511.01132 (2015)"},{"key":"1_CR4","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"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1111\/1467-937X.00164","volume":"68","author":"JP Benoit","year":"2001","unstructured":"Benoit, J.P., Krishna, V.: Multiple-object auctions with budget constrained bidders. Rev. Econ. Stud. 68(1), 155\u2013179 (2001)","journal-title":"Rev. Econ. Stud."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Conitzer, V., Munagala, K., Xia, L.: Incentive compatible budget elicitation in multi-unit auctions. In: SODA, pp. 554\u2013572 (2010)","DOI":"10.1137\/1.9781611973075.47"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare guarantees for combinatorial auctions with item bidding. In: SODA, pp. 700\u2013709 (2011)","DOI":"10.1137\/1.9781611973082.55"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-35311-6_25","volume-title":"Internet and Network Economics","author":"K Bhawalkar","year":"2012","unstructured":"Bhawalkar, K., Roughgarden, T.: Simultaneous single-item auctions. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 337\u2013349. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-35311-6_25"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: EC, pp. 44\u201351 (2005)","DOI":"10.1145\/1064009.1064014"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Cai, Y., Papadimitriou, C.: Simultaneous Bayesian auctions and computational complexity. In: EC, pp. 895\u2013910 (2014)","DOI":"10.1145\/2600057.2602877"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-662-44803-8_18","volume-title":"Algorithmic Game Theory","author":"I Caragiannis","year":"2014","unstructured":"Caragiannis, I., Voudouris, A.A.: Welfare guarantees for proportional allocations. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 206\u2013217. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44803-8_18"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-13129-0_7","volume-title":"Web and Internet Economics","author":"H Chan","year":"2014","unstructured":"Chan, H., Chen, J.: Truthful multi-unit procurements with budgets. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 89\u2013105. Springer, Cham (2014). doi:10.1007\/978-3-319-13129-0_7"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Chawla, S., Malec, D., Malekian, A.: Bayesian mechanism design for budget-constrained agents. In: EC, pp. 253\u2013262 (2011)","DOI":"10.1145\/1993574.1993613"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/1467-937X.00033","volume":"65","author":"YK Che","year":"1998","unstructured":"Che, Y.K., Gale, I.: Standard auctions with financially constrained bidders. Rev. Econ. Stud. 65(1), 1\u201321 (1998)","journal-title":"Rev. Econ. Stud."},{"key":"1_CR15","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"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-540-70575-8_67","volume-title":"Automata, Languages and Programming","author":"G Christodoulou","year":"2008","unstructured":"Christodoulou, G., Kov\u00e1cs, A., Schapira, M.: Bayesian combinatorial auctions. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 820\u2013832. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-70575-8_67"},{"key":"1_CR17","unstructured":"Christodoulou, G., Kov\u00e1cs, A., Sgouritsa, A., Tang, B.: Tight bounds for the price of anarchy of simultaneous first price auctions. CoRR abs\/1312.2371 (2013)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-662-48433-3_13","volume-title":"Algorithmic Game Theory","author":"G Christodoulou","year":"2015","unstructured":"Christodoulou, G., Sgouritsa, A., Tang, B.: On the efficiency of the proportional allocation mechanism for divisible resources. In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 165\u2013177. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48433-3_13"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Fu, H., Kleinberg, R.: On the complexity of computing an equilibrium in combinatorial auctions. In: SODA, pp. 110\u2013122 (2015)","DOI":"10.1137\/1.9781611973730.9"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. In: FOCS, pp. 260\u2013269 (2008)","DOI":"10.1109\/FOCS.2008.39"},{"key":"1_CR21","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":"1_CR22","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Papadimitriou, C., Singer, Y.: Mechanisms for complement-free procurement. In: EC, pp. 273\u2013282 (2011)","DOI":"10.1145\/1993574.1993615"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Eden, A., Feldman, M., Fiat, A., Leonardi, S.: Lottery pricing equilibria. In: EC, pp. 401\u2013418 (2016)","DOI":"10.1145\/2940716.2940742"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-45046-4_13","volume-title":"Web and Internet Economics","author":"P D\u00fctting","year":"2013","unstructured":"D\u00fctting, P., Henzinger, M., Starnberger, M.: Valuation compressions in VCG-based combinatorial auctions. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 146\u2013159. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-45046-4_13"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient. In: STOC, pp. 201\u2013210 (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial walrasian equilibrium. In: STOC, pp. 61\u201370 (2013)","DOI":"10.1145\/2488608.2488617"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Hartline, J., Hoy, D., Taggart, S.: Price of anarchy for auction revenue. In: EC, pp. 693\u2013710 (2014)","DOI":"10.1145\/2600057.2602878"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kaplan, H., Mansour, Y., Nisan, N.: Non-price equilibria in markets of discrete goods. In: EC, pp. 295\u2013296 (2011)","DOI":"10.1145\/1993574.1993619"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). doi:10.1007\/3-540-49116-3_38"},{"issue":"2","key":"1_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0165-1765(96)00849-X","volume":"52","author":"JJ Laffont","year":"1996","unstructured":"Laffont, J.J., Robert, J.: Optimal auction with financially constrained buyers. Econ. Lett. 52(2), 181\u2013186 (1996)","journal-title":"Econ. Lett."},{"issue":"2","key":"1_CR31","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Lu, P., Xiao, T.: Improved efficiency guarantees in auctions with budgets. In: EC, pp. 397\u2013413 (2015)","DOI":"10.1145\/2764468.2764500"},{"issue":"4","key":"1_CR33","first-page":"245","volume":"12","author":"A Malakhov","year":"2008","unstructured":"Malakhov, A., Vohra, R.V.: Optimal auctions for asymmetrically budget constrained bidders. Rev. Econ. Des. 12(4), 245\u2013257 (2008)","journal-title":"Rev. Econ. Des."},{"key":"1_CR34","unstructured":"Pai, M., Vohra, R.V.: Optimal auctions with financially constrained bidders. Discussion papers, Northwestern University, Center for Mathematical Studies in Economics and Management Science, August 2008"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: STOC, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"1_CR36","volume-title":"Algorithmic Game Theory","author":"T Roughgarden","year":"2007","unstructured":"Roughgarden, T., Tardos, E.: Introduction to the inefficiency of equilibria. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: FOCS, pp. 765\u2013774 (2010)","DOI":"10.1109\/FOCS.2010.78"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, E.: 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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:25:38Z","timestamp":1709828738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}