{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:46:15Z","timestamp":1743057975113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_23","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"323-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nash Social Welfare in Selfish and Online Load Balancing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7848-4904","authenticated-orcid":false,"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0998-5649","authenticated-orcid":false,"given":"Gianpiero","family":"Monaco","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7741-9342","authenticated-orcid":false,"given":"Cosimo","family":"Vinci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"issue":"5","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5), 1211\u20131233 (2011)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"23_CR3","unstructured":"Awerbuch, B., Yossi, A., Grove, E.F., Kao, M., Krishnan, P., Vitter, J.S.: Load balancing in the l$${}_{\\text{p}}$$ norm. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 383\u2013391 (1995)"},{"key":"23_CR4","unstructured":"Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. In: Proceedings of the Third Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms (SODA), pp. 203\u2013210 (1992)"},{"key":"23_CR5","volume-title":"Studies in the Economics of Transportation","author":"MJ Beckmann","year":"1956","unstructured":"Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/3340234","volume":"7","author":"X Bei","year":"2019","unstructured":"Bei, X., Garg, J., Hoefer, M., Mehlhorn, K.: Earning and utility limits in fisher markets. ACM Trans. Econ. Comput. 7(2), 10:1\u201310:35 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629666","volume":"2","author":"K Bhawalkar","year":"2014","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: price of anarchy, universal worst-case examples, and tightness. ACM Trans. Econ. Comput. 2(4), 1\u201323 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"5","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1007\/s00224-017-9826-1","volume":"62","author":"V Bil\u00f2","year":"2018","unstructured":"Bil\u00f2, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. Theory Comput. Syst. 62(5), 1288\u20131317 (2018). https:\/\/doi.org\/10.1007\/s00224-017-9826-1","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00224-010-9309-0","volume":"49","author":"V Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Performances of one-round walks in linear congestion games. Theory Comput. Syst. 49(1), 24\u201345 (2011). https:\/\/doi.org\/10.1007\/s00224-010-9309-0","journal-title":"Theory Comput. Syst."},{"key":"23_CR10","unstructured":"Bil\u00f2, V., Vinci, C.: On the impact of singleton strategies in congestion games. In: Proceedings of the 25th Annual European Symposium on Algorithms, (ESA), pp. 17:1\u201317:14 (2017)"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/3355946","volume":"7","author":"V Bil\u00f2","year":"2019","unstructured":"Bil\u00f2, V., Vinci, C.: Dynamic taxes for polynomial congestion games. ACM Trans. Econ. Comput. 7(3), 15:1\u201315:36 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"key":"23_CR12","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"23_CR13","unstructured":"Brainard, W.C., Scarf, H.E.: How to compute equilibrium prices in 1891. CowlesFoundation Discussion Paper 1270 (2000)"},{"key":"23_CR14","unstructured":"Caragiannis, I.: Better bounds for online load balancing on unrelated machines. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 972\u2013981 (2008)"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. Algorithmica 61(3), 606\u2013637 (2011). https:\/\/doi.org\/10.1007\/s00453-010-9427-8","journal-title":"Algorithmica"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 2016 ACM Conference on Economics and Computation (EC), pp. 305\u2013322 (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Mehta, A., Nagarajan, V., Vazirani, V.: Fairness and optimality in congestion games. In: Proceedings of the 6th ACM Conference on Electronic Commerce (EC), pp. 52\u201357 (2005)","DOI":"10.1145\/1064009.1064015"},{"key":"23_CR18","unstructured":"Chekuri, C., Khanna, S.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chap. Approximation Algorithms for Minimizing Average Weighted Completion Time. Chapman & Hall\/CRC, London (2004)"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2012.02.033","volume":"438","author":"G Christodoulou","year":"2012","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. Theor. Comput. Sci. 438, 13\u201327 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/15M1053682","volume":"47","author":"R Cole","year":"2018","unstructured":"Cole, R., Gkatzelis, V.: Approximating the Nash social welfare with indivisible items. SIAM J. Comput. 47(3), 1211\u20131236 (2018)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2007","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3(1), 4:1\u20134:17 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"PJ Fleming","year":"1986","unstructured":"Fleming, P.J., Wallace, J.: How not to lie with statistics: the correct way to summarize benchmark results. Commun. ACM 29(3), 218\u2013221 (1986)","journal-title":"Commun. ACM"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-77105-0_42","volume-title":"Internet and Network Economics","author":"M Gairing","year":"2007","unstructured":"Gairing, M., Schoppmann, F.: Total latency in singleton congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 381\u2013387. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_42"},{"issue":"9","key":"23_CR24","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.K.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23, 317\u2013327 (1976)","journal-title":"J. ACM"},{"key":"23_CR27","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: Proceedings of the 20th AAAI Conference on Artificial Intelligence (AAAI), pp. 489\u2013494 (2005)"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-30473-7_14","volume-title":"Algorithmic Game Theory","author":"M Klimm","year":"2019","unstructured":"Klimm, M., Schmand, D., T\u00f6nnis, A.: The online best reply algorithm for resource allocation problems. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 200\u2013215. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_14"},{"key":"23_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). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990). https:\/\/doi.org\/10.1007\/BF01585745","journal-title":"Math. Program."},{"issue":"2","key":"23_CR31","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1002\/net.20439","volume":"59","author":"CA Meyers","year":"2012","unstructured":"Meyers, C.A., Schulz, A.S.: The complexity of welfare maximization in congestion games. Networks 59(2), 252\u2013260 (2012)","journal-title":"Networks"},{"issue":"2","key":"23_CR32","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J Nash","year":"1950","unstructured":"Nash, J.: The bargaining problem. Econometrica 18(2), 155\u2013162 (1950)","journal-title":"Econometrica"},{"key":"23_CR33","volume-title":"The Economics of Welfare","author":"AC Pigou","year":"1938","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan and Co., London (1938)"},{"key":"23_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973). https:\/\/doi.org\/10.1007\/BF01737559","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"23_CR35","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2), 341\u2013364 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"23_CR36","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"23_CR37","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden, T., Tardos, E.: Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econ. Behav. 47(2), 389\u2013403 (2004)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"23_CR38","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47(1), 79\u201396 (2007). https:\/\/doi.org\/10.1007\/s00453-006-1211-4","journal-title":"Algorithmica"},{"key":"23_CR39","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2018.06.038","volume":"764","author":"C Vinci","year":"2019","unstructured":"Vinci, C.: Non-atomic one-round walks in congestion games. Theor. Comput. Sci. 764, 61\u201379 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR40","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: Algorithmic Game Theory, chap. Selfish Load Balancing, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.022"},{"issue":"36","key":"23_CR41","first-page":"352","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. Part II 1(36), 352\u2013362 (1952)","journal-title":"Proc. Inst. Civ. Eng. Part II"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T16:54:57Z","timestamp":1670000097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","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":"Beijing","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"136","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":"31","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":"11","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":"23% - 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":"10","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}