{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:22:32Z","timestamp":1743009752662,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"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_12","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"147-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reconciling Selfish Routing with Social Good"],"prefix":"10.1007","author":[{"given":"Soumya","family":"Basu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ger","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanasis","family":"Lianeas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evdokia","family":"Nikolova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yitao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Basu, S., Yang, G., Lianeas, T., Nikolova, E., Chen, Y.: Reconciling selfish routing with social good. arXiv:1707.00208 (2017)","DOI":"10.1007\/978-3-319-66700-3_12"},{"key":"12_CR2","unstructured":"Beckmann, M., McGuire, C., Winsten, C.B.: Studies in the economics of transportation. Technical report (1956)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V.F., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17\u201331 (2011)","journal-title":"Oper. Res."},{"issue":"12","key":"12_CR4","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1287\/mnsc.1120.1549","volume":"58","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Farias, V.F., Trichakis, N.: On the efficiency-fairness trade-off. Manag. Sci. 58(12), 2234\u20132250 (2012)","journal-title":"Manag. Sci."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/2325713.2325718","volume":"11","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Computing approximate pure nash equilibria in congestion games. ACM SIGecom Exch. 11(1), 26\u201329 (2012)","journal-title":"ACM SIGecom Exch."},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2614687","volume":"3","author":"I Caragiannis","year":"2015","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Trans. Econ. Comput. 3(1), 2 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"12_CR7","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). doi:10.1007\/11786986_28"},{"key":"12_CR8","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. In: SODA (2007)"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"G Christodoulou","year":"2011","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-25960-2_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Computational complexity, fairness, and the price of anarchy of the maximum latency problem. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 59\u201373. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-25960-2_5"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"JR Correa","year":"2007","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Fast, fair, and efficient flows in networks. Oper. Res. 55(2), 215\u2013225 (2007)","journal-title":"Oper. Res."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.geb.2008.01.001","volume":"64","author":"JR Correa","year":"2008","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: A geometric approach to the price of anarchy in nonatomic congestion games. Games Econ. Behav. 64(2), 457\u2013469 (2008)","journal-title":"Games Econ. Behav."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-69355-0_18","volume-title":"Structural Information and Communication Complexity","author":"AE Feldmann","year":"2008","unstructured":"Feldmann, A.E., R\u00f6glin, H., V\u00f6cking, B.: Computing approximate nash equilibria in network congestion games. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 209\u2013220. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-69355-0_18"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-30140-0_30","volume-title":"Algorithms \u2013 ESA 2004","author":"S Fischer","year":"2004","unstructured":"Fischer, S., V\u00f6cking, B.: On the evolution of selfish routing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 323\u2013334. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30140-0_30"},{"key":"12_CR15","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: FOCS (2004)"},{"key":"12_CR16","unstructured":"Harks, T.: On the price of anarchy of network games with nonatomic and atomic players. Technical report, available at Optimization Online (2007)"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O Jahn","year":"2005","unstructured":"Jahn, O., M\u00f6hring, R.H., Schulz, A.S., Stier-Moses, N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res. 53(4), 600\u2013616 (2005)","journal-title":"Oper. Res."},{"key":"12_CR18","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"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: STOC (2001)","DOI":"10.1145\/380752.380783"},{"key":"12_CR20","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: SODA (2002)"},{"issue":"5","key":"12_CR21","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM (JACM) 62(5), 32 (2015)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","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 (JACM) 49(2), 236\u2013259 (2002)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/net.20133","volume":"48","author":"AS Schulz","year":"2006","unstructured":"Schulz, A.S., Stier-Moses, N.E.: Efficiency and fairness of system-optimal routing with user constraints. Networks 48(4), 223\u2013234 (2006)","journal-title":"Networks"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:26:20Z","timestamp":1709828780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_12","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"}}]}}