{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:23:13Z","timestamp":1725884593544},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"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"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_23","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"272-284","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Cost-Sharing in Generalised Selfish Routing"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gairing","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Kollias","sequence":"additional","affiliation":[]},{"given":"Grammateia","family":"Kotsialou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-44777-2_2","volume-title":"Algorithms - ESA 2014","author":"F Abed","year":"2014","unstructured":"Abed, F., Correa, J.R., Huang, C.-C.: Optimal coordination mechanisms for multi-job scheduling games. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 13\u201324. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44777-2_2"},{"issue":"5","key":"23_CR2","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":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., 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":"23_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of STOC, pp. 57\u201366. ACM (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bhaskar, U., Fleischer, L., Hoy, D., Huang, C.: Equilibria of atomic flow games are not unique. In: Proceedings of SODA, pp. 748\u2013757 (2009)","DOI":"10.1137\/1.9781611973068.82"},{"issue":"4","key":"23_CR6","first-page":"14","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. Proc. of ACM TEAC 2(4), 14 (2014)","journal-title":"Proc. of ACM TEAC"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-39212-2_44","volume-title":"Automata, Languages, and Programming","author":"G Christodoulou","year":"2013","unstructured":"Christodoulou, G., Gairing, M.: Price of stability in polynomial congestion games. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 496\u2013507. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39212-2_44"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of STOC, pp. 67\u201373. ACM (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"6","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1287\/opre.1080.0653","volume":"57","author":"R Cominetti","year":"2009","unstructured":"Cominetti, R., Correa, J.R., Moses, N.E.S.: The impact of oligopolistic competition in networks. Oper. Res. 57(6), 1421\u20131437 (2009)","journal-title":"Oper. Res."},{"issue":"4","key":"23_CR10","first-page":"52","volume":"4","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic congestion games among coalitions. ACM Trans. Algorithms (TALG) 4(4), 52 (2008)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1080\/15427951.2008.10129175","volume":"5","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D., Spirakis, P.G.: Cost-balancing tolls for atomic network congestion games. Internet Math. 5(4), 343\u2013363 (2008)","journal-title":"Internet Math."},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-662-47666-6_50","volume-title":"Automata, Languages, and Programming","author":"M Gairing","year":"2015","unstructured":"Gairing, M., Kollias, K., Kotsialou, G.: Tight bounds for cost-sharing in weighted congestion games. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 626\u2013637. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-47666-6_50"},{"key":"23_CR13","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). doi:10.1007\/978-3-540-77105-0_42"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-13129-0_6","volume-title":"Web and Internet Economics","author":"V Gkatzelis","year":"2014","unstructured":"Gkatzelis, V., Kollias, K., Roughgarden, T.: Optimal cost-sharing in weighted congestion games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 72\u201388. Springer, Cham (2014). doi:10.1007\/978-3-319-13129-0_6"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/moor.2014.0651","volume":"39","author":"R Gopalakrishnan","year":"2014","unstructured":"Gopalakrishnan, R., Marden, J.R., Wierman, A.: Potential games are necessary to ensure pure Nash equilibria in cost sharing games. Math. Oper. Res. 39, 1252\u20131296 (2014)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00224-010-9269-4","volume":"48","author":"T Harks","year":"2011","unstructured":"Harks, T.: Stackelberg strategies and collusion in network games with splittable flow. Theory Comput. Syst. 48(4), 781\u2013802 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/moor.1120.0543","volume":"37","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M.: On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res. 37(3), 419\u2013436 (2012)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s00224-011-9315-x","volume":"49","author":"T Harks","year":"2011","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Characterizing the existence of potential functions in weighted congestion games. Theory Comput. Syst. 49(1), 46\u201370 (2011)","journal-title":"Theory Comput. Syst."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Hart, S., Mas-Colell, A.: Potential, value, and consistency. Econom.: J. Econom. Soc. 589\u2013614 (1989)","DOI":"10.2307\/1911054"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Tardos, \u00c9., Wexler, T.: The effect of collusion in congestion games. In: Proceedings of STOC, pp. 89\u201398 (2006)","DOI":"10.1145\/1132516.1132529"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-18173-8_20","volume-title":"Algorithms and Complexity","author":"M Klimm","year":"2015","unstructured":"Klimm, M., Schmand, D.: Sharing non-anonymous costs of multiple resources optimally. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 274\u2013287. Springer, Cham (2015). doi:10.1007\/978-3-319-18173-8_20"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-22012-8_43","volume-title":"Automata, Languages and Programming","author":"K Kollias","year":"2011","unstructured":"Kollias, K., Roughgarden, T.: Restoring pure equilibria to weighted congestion games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 539\u2013551. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22012-8_43"},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"23_CR24","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"5","key":"23_CR25","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive routing in multiuser communication networks. IEEE\/ACM Trans. Netw. 1(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"23_CR26","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)","journal-title":"Int. J. Game Theory"},{"issue":"1","key":"23_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"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of STOC, pp. 513\u2013522. ACM (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"23_CR29","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.jet.2014.04.005","volume":"156","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T., Schoppmann, F.: Local smoothness and the price of anarchy in splittable congestion games. J. Econ. Theory 156, 317\u2013342 (2015)","journal-title":"J. Econ. Theory"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-662-44803-8_12","volume-title":"Algorithmic Game Theory","author":"T Roughgarden","year":"2014","unstructured":"Roughgarden, T., Schrijvers, O.: Network cost-sharing without anonymity. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 134\u2013145. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44803-8_12"},{"issue":"2","key":"23_CR31","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)"},{"key":"23_CR32","volume-title":"Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods","author":"Y Sheffi","year":"1985","unstructured":"Sheffi, Y.: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Upper Saddle River (1985)"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-24829-0_22","volume-title":"Algorithmic Game Theory","author":"L Tran-Thanh","year":"2011","unstructured":"Tran-Thanh, L., Polukarov, M., Chapman, A., Rogers, A., Jennings, N.R.: On the existence of pure strategy Nash equilibria in integer\u2013splittable weighted congestion games. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 236\u2013253. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-24829-0_22"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:49:40Z","timestamp":1710341380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_23","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":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 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":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}