{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:52Z","timestamp":1742914192865,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"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_20","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"280-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving Approximate Pure Nash Equilibria in Congestion Games"],"prefix":"10.1007","author":[{"given":"Vipin","family":"Ravindran Vijayalakshmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1\u201325:22 (2008)","DOI":"10.1145\/1455248.1455249"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5) (2011)","DOI":"10.1137\/090748986"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing. STOC (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"5","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1007\/978-3-642-38016-7_18","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. Theor. Comp. Syst. 62(5), 1288\u20131317 (2018). https:\/\/doi.org\/10.1007\/978-3-642-38016-7_18","journal-title":"Theor. Comp. Syst."},{"issue":"1","key":"20_CR5","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.: Performance 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":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Vinci, C.: Dynamic taxes for polynomial congestion games. In: Proceedings of the 2016 ACM Conference on Economics and Computation. EC (2016)","DOI":"10.1145\/2940716.2940750"},{"key":"20_CR7","unstructured":"Bil\u00f2, V., Vinci, C.: On the impact of singleton strategies in congestion games. In: 25th Annual European Symposium on Algorithms (ESA) (2017)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Bjelde, A., Klimm, M., Schmand, D.: Brief announcement: approximation algorithms for unsplittable resource allocation problems with diseconomies of scale. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA 2017, ACM, New York, NY, USA (2017)","DOI":"10.1145\/3087556.3087597"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient computation of approximate pure Nash equilibria in congestion games. In: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. FOCS (2011)","DOI":"10.1109\/FOCS.2011.50"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Automata, Languages and Programming","author":"I Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 311\u2013322. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11786986_28"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Chandan, R., Paccagnan, D., Marden, J.R.: When smoothness is not enough: toward exact quantification and optimization of the price-of-anarchy. In: 2019 IEEE 58th Conference on Decision and Control (CDC) (2019)","DOI":"10.1109\/CDC40024.2019.9030121"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Chandan, R., Paccagnan, D., Ferguson, B.L., Marden, J.R.: Computing optimal taxes in atomic congestion games. In: Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation. NetEcon (2019)","DOI":"10.1145\/3338506.3340239"},{"key":"20_CR13","unstructured":"Chandan, R., Paccagnan, D., Marden, J.R.: Optimal mechanisms for distributed resource-allocation. Preprint (2019). http:\/\/arxiv.org\/abs\/1911.07823"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing. STOC 2005, ACM, New York, NY, USA (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. Theoret. Comput. Sci. 438 (2012)","DOI":"10.1016\/j.tcs.2012.02.033"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.geb.2013.03.011","volume":"92","author":"R Cole","year":"2015","unstructured":"Cole, R., Correa, J., Gkatzelis, V., Mirrokni, V., Olver, N.: Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92, 306\u2013326 (2015)","journal-title":"Games Econ. Behav."},{"issue":"5","key":"20_CR17","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1002\/nav.21497","volume":"59","author":"J Correa","year":"2012","unstructured":"Correa, J., Queyranne, M.: Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost. Naval Res. Logistics 59(5), 384\u2013395 (2012)","journal-title":"Naval Res. Logistics"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing. STOC 2004, ACM, New York, NY, USA (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-13129-0_3","volume-title":"Web and Internet Economics","author":"M Feldotto","year":"2014","unstructured":"Feldotto, M., Gairing, M., Skopalik, A.: Bounding the potential function in congestion games and approximate pure Nash equilibria. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 30\u201343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_3"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00224-009-9191-9","volume":"47","author":"M Gairing","year":"2010","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. Theory of Computing Systems 47(2), 405\u2013435 (2010). https:\/\/doi.org\/10.1007\/s00224-009-9191-9","journal-title":"Theory of Computing Systems"},{"key":"20_CR21","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":"20_CR22","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 16th Annual Conference on Theoretical Aspects of Computer Science. STACS (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Makarychev, K., Sviridenko, M.: Solving optimization problems with diseconomies of scale via decoupling. In: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. FOCS (2014)","DOI":"10.1109\/FOCS.2014.67"},{"issue":"2","key":"20_CR24","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"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Orlin, J.B., Punnen, A.P., Schulz, A.S.: Approximate local search in combinatorial optimization. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA (2004)","DOI":"10.1137\/S0097539703431007"},{"key":"20_CR26","unstructured":"Paccagnan, D., Chandan, R., Ferguson, B.L., Marden, J.R.: Incentivizing efficient use of shared infrastructure: optimal tolls in congestion games. Preprint (2020). http:\/\/arxiv.org\/abs\/1911.09806"},{"issue":"1","key":"20_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.3230030104","volume":"3","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: The network equilibrium problem in integers. Networks 3(1), 53\u201359 (1973)","journal-title":"Networks"},{"issue":"1","key":"20_CR28","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(1), 65\u201367 (1973). https:\/\/doi.org\/10.1007\/BF01737559","journal-title":"Int. J. Game Theory"},{"key":"20_CR29","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 93\u2013102, November 2000"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing. STOC (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Barriers to near-optimal equilibria. In: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. FOCS (2014)","DOI":"10.1109\/FOCS.2014.16"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Schoppmann, F.: Local smoothness and the price of anarchy in atomic splittable congestion games. In: Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA (2011)","DOI":"10.1137\/1.9781611973082.22"},{"key":"20_CR33","unstructured":"Skopalik, A., Vijayalakshmi, V.R.: Improving approximate pure Nash equilibria in congestion games. Preprint (2020). https:\/\/arxiv.org\/abs\/2007.15520"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. STOC (2008)","DOI":"10.1145\/1374376.1374428"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:10:32Z","timestamp":1607159432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_20","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)"}}]}}