{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:49:05Z","timestamp":1778496545519,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T00:00:00Z","timestamp":1472083200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["M008118\/1"],"award-info":[{"award-number":["M008118\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["K01000X\/1"],"award-info":[{"award-number":["K01000X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["LT140046"],"award-info":[{"award-number":["LT140046"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00224-016-9701-5","type":"journal-article","created":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T02:35:45Z","timestamp":1472092545000},"page":"600-618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources"],"prefix":"10.1007","volume":"59","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3997-5131","authenticated-orcid":false,"given":"Alkmini","family":"Sgouritsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,25]]},"reference":[{"issue":"4","key":"9701_CR1","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"9701_CR2","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare guarantees for combinatorial auctions with item bidding. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 700\u2013709, California, USA (2011)","DOI":"10.1137\/1.9781611973082.55"},{"key":"9701_CR3","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Voudouris, A.A.: Welfare guarantees for proportional allocations. In: Algorithmic Game Theory - 7th International Symposium, SAGT 2014, pp. 206\u2013217. Proceedings, Haifa, Israel (2014)","DOI":"10.1007\/978-3-662-44803-8_18"},{"issue":"5","key":"9701_CR4","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H-L Chen","year":"2010","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput. 39(5), 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"key":"9701_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Kov\u00e1cs, A., Schapira, M.: Bayesian combinatorial auctions. In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, pp. 820-832. Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, Reykjavik, Iceland (2008)","DOI":"10.1007\/978-3-540-70575-8_67"},{"issue":"2","key":"9701_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/2847520","volume":"4","author":"G Christodoulou","year":"2016","unstructured":"Christodoulou, G., Kov\u00e1cs, A., Sgouritsa, A., Tang, B.: Tight bounds for the price of anarchy of simultaneous first-price auctions. ACM Trans. Econ. Comput. 4(2), 9 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"9701_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Sgouritsa, A., Tang, B.: On the efficiency of the proportional allocation mechanism for divisible resources. In: Algorithmic Game Theory - 8th International Symposium, SAGT 2015, pp. 165-177. Proceedings, Saarbr\u00fccken, Germany (2015)","DOI":"10.1007\/978-3-662-48433-3_13"},{"key":"9701_CR8","volume-title":"Market-based proportional resource sharing for clusters","author":"BN Chun","year":"2000","unstructured":"Chun, B.N., Culler, D.E.: Market-based proportional resource sharing for clusters. Technical Report, University of California at Berkeley, CA, USA (2000)"},{"key":"9701_CR9","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: The price of anarchy of the proportional allocation mechanism revisited. In: Web and Internet Economics - 9th International Conference, WINE 2013, pp. 109-120. Proceedings, MA, USA (2013)","DOI":"10.1007\/978-3-642-45046-4_10"},{"key":"9701_CR10","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Paes Leme, R.: Efficiency guarantees in auctions with budgets. In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, pp. 392\u2013404. Proceedings, Part I, Copenhagen, Denmark (2014)","DOI":"10.1007\/978-3-662-43948-7_33"},{"issue":"1","key":"9701_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.1090.0436","volume":"35","author":"S Dobzinski","year":"2010","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. Math. Oper Res. 35(1), 1\u201313 (2010)","journal-title":"Math. Oper Res."},{"key":"9701_CR12","unstructured":"Evans, D.S., Heckman, J.J.: A test for subadditivity of the cost function with an application to the bell system. Amer. Econ. Rev., 615\u2013623 (1984)"},{"key":"9701_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient, CA, USA (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"9701_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, M., Lai, K., Zhang, L.: A price-anticipating resource allocation mechanism for distributed shared clusters. In: Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), pp. 127\u2013136, BC, Canada (2005)","DOI":"10.1145\/1064009.1064023"},{"key":"9701_CR15","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kaplan, H., Mansour, Y., Nisan, N.: Non-price equilibria in markets of discrete goods. In: Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), pp. 295\u2013296, CA, USA (2011)","DOI":"10.1145\/1993574.1993619"},{"issue":"3","key":"9701_CR16","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R Johari","year":"2004","unstructured":"Johari, R., Tsitsiklis, J.N.: Efficiency loss in a network resource allocation game. Math. Oper Res. 29(3), 407\u2013435 (2004)","journal-title":"Math. Oper Res."},{"issue":"4","key":"9701_CR17","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1287\/opre.1080.0638","volume":"57","author":"R Johari","year":"2009","unstructured":"Johari, R., Tsitsiklis, J.N.: Efficiency of scalar-parameterized mechanisms. Oper. Res. 57(4), 823\u2013839 (2009)","journal-title":"Oper. Res."},{"issue":"1","key":"9701_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F Kelly","year":"1997","unstructured":"Kelly, F.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8(1), 33\u201337 (1997)","journal-title":"Eur. Trans. Telecommun."},{"key":"9701_CR19","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404-413. Proceedings, Trier, Germany (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9701_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Tardos, \u00c9.: Approximately maximizing efficiency and revenue in polyhedral environments. In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), pp. 11\u201319, California, USA (2007)","DOI":"10.1145\/1250910.1250913"},{"key":"9701_CR21","doi-asserted-by":"crossref","unstructured":"Nisan, N.: The communication complexity of approximate set packing and covering. In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, pp. 868-875. Proceedings, Malaga, Spain (2002)","DOI":"10.1007\/3-540-45465-9_74"},{"issue":"3","key":"9701_CR22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1215\/S0012-7094-50-01721-2","volume":"17","author":"RA Rosenbaum","year":"1950","unstructured":"Rosenbaum, R.A.: Sub-additive functions. Duke Math. J. 17(3), 227\u2013247, 09 (1950)","journal-title":"Duke Math. J."},{"key":"9701_CR23","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Barriers to near-optimal equilibria. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, pp. 71\u201380, PA, USA (2014)","DOI":"10.1109\/FOCS.2014.16"},{"issue":"1","key":"9701_CR24","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/2737816","volume":"3","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. ACM Trans. Econ. Comput. 3(1), 6 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"2","key":"9701_CR25","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"9701_CR26","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, \u00c9.: Composable and efficient mechanisms, CA, USA (2013)","DOI":"10.1145\/2488608.2488635"},{"key":"9701_CR27","doi-asserted-by":"publisher","unstructured":"Zhang, L.: The Efficiency and Fairness of a Fixed Budget Resource Allocation Game. In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp 485\u2013496 (2005), doi: 10.1007\/11523468_40","DOI":"10.1007\/11523468_40"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9701-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9701-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9701-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T19:10:40Z","timestamp":1568315440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9701-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,25]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9701"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9701-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,25]]}}}