{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:09:54Z","timestamp":1743019794442,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"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"}],"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_19","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Congestion Games with Complementarities"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Feldotto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lennart","family":"Leder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"issue":"17","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1016\/j.tcs.2008.12.035","volume":"410","author":"H Ackermann","year":"2009","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theoret. Comput. Sci. 410(17), 1552\u20131563 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H Ackermann","year":"2008","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)","journal-title":"J. ACM"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/15427951.2008.10129170","volume":"5","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., Skopalik, A.: Complexity of pure Nash equilibria in player-specific network congestion games. Internet Math. 5(4), 323\u2013342 (2008)","journal-title":"Internet Math."},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2307\/1927286","volume":"43","author":"KJ Arrow","year":"1961","unstructured":"Arrow, K.J., Chenery, H.B., Minhas, B.S., Solow, R.M.: Capital-labor substitution and economic efficiency. Rev. Econ. Stat. 43(3), 225\u2013250 (1961)","journal-title":"Rev. Econ. Stat."},{"issue":"6","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R Banner","year":"2007","unstructured":"Banner, R., Orda, A.: Bottleneck routing games in communication networks. IEEE J. Sel. Areas Commun. 25(6), 1173\u20131179 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-04645-2_20","volume-title":"Algorithmic Game Theory","author":"A Byde","year":"2009","unstructured":"Byde, A., Polukarov, M., Jennings, N.R.: Games with congestion-averse utilities. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 220\u2013232. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04645-2_20"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient computation of approximate pure Nash equilibria in congestion games. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), pp. 532\u2013541 (2011)","DOI":"10.1109\/FOCS.2011.50"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-44803-8_5","volume-title":"Algorithmic Game Theory","author":"I Caragiannis","year":"2014","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N.: Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 49\u201360. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44803-8_5"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"2:1","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:1\u20132:32 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S Chien","year":"2011","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. Games Econ. Behav. 71(2), 315\u2013327 (2011)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"19_CR11","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"},{"issue":"3","key":"19_CR12","first-page":"297","volume":"67","author":"AK Dixit","year":"1977","unstructured":"Dixit, A.K., Stiglitz, J.E.: Monopolistic competition and optimum product diversity. Am. Econ. Rev. 67(3), 297\u2013308 (1977)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/moor.1080.0322","volume":"33","author":"J Dunkel","year":"2008","unstructured":"Dunkel, J., Schulz, A.S.: On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. Math. Oper. Res. 33(4), 851\u2013868 (2008)","journal-title":"Math. Oper. Res."},{"key":"19_CR14","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), pp. 604\u2013612. ACM, New York (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"19_CR15","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). doi:10.1007\/978-3-319-13129-0_3"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-319-48749-6_47","volume-title":"Combinatorial Optimization and Applications","author":"M Feldotto","year":"2016","unstructured":"Feldotto, M., Leder, L., Skopalik, A.: Congestion games with mixed objectives. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 655\u2013669. Springer, Cham (2016). doi:10.1007\/978-3-319-48749-6_47"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theoret. Comput. Sci. 348(2), 226\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR18","unstructured":"Hansknecht, C., Klimm, M., Skopalik, A.: Approximate pure Nash equilibria in weighted congestion games. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014), Dagstuhl, Germany. LIPIcs, vol. 28, pp. 242\u2013257 (2014)"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10107-012-0521-3","volume":"141","author":"T Harks","year":"2013","unstructured":"Harks, T., Hoefer, M., Klimm, M., Skopalik, A.: Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. 141(1), 193\u2013215 (2013)","journal-title":"Math. Program."},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-10841-9_43","volume-title":"Internet and Network Economics","author":"T Harks","year":"2009","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Strong Nash equilibria in games with the lexicographical improvement property. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 463\u2013470. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-10841-9_43"},{"key":"19_CR21","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: AAAI, pp. 489\u2013494. AAAI Press\/The MIT Press (2005)"},{"key":"19_CR22","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 1999","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"},{"issue":"6","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1134\/S0005117915060144","volume":"76","author":"NS Kukushkin","year":"2015","unstructured":"Kukushkin, N.S.: Rosenthal\u2019s potential and a discrete version of the Debreu-Gorman Theorem. Autom. Remote Control 76(6), 1101\u20131110 (2015)","journal-title":"Autom. Remote Control"},{"issue":"1","key":"19_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00182-007-0090-5","volume":"36","author":"NS Kukushkin","year":"2007","unstructured":"Kukushkin, N.S.: Congestion games revisited. Int. J. Game Theory 36(1), 57\u201383 (2007)","journal-title":"Int. J. Game Theory"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-540-74456-6_56","volume-title":"Mathematical Foundations of Computer Science 2007","author":"M Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Milchtaich, I., Monien, B., Tiemann, K.: Congestion games with player-specific constants. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 633\u2013644. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74456-6_56"},{"issue":"1","key":"19_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games Econ. Behav. 13(1), 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"19_CR27","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":"1","key":"19_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)","journal-title":"Int. J. Game Theory"},{"issue":"5","key":"19_CR29","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM 62(5), 32:1\u201332:42 (2015)","journal-title":"J. ACM"},{"key":"19_CR30","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer Science & Business Media, Heidelberg (2002)"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC 2008), pp. 355\u2013364. ACM, New York (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-10841-9_61","volume-title":"Internet and Network Economics","author":"T Voice","year":"2009","unstructured":"Voice, T., Polukarov, M., Byde, A., Jennings, N.R.: On the impact of strategy and utility structures on congestion-averse games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 600\u2013607. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-10841-9_61"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:48:53Z","timestamp":1710341333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_19","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"}}]}}