{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:01Z","timestamp":1740122401405,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T00:00:00Z","timestamp":1508457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB901","SFB901"],"award-info":[{"award-number":["SFB901","SFB901"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-017-0189-y","type":"journal-article","created":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T21:50:20Z","timestamp":1508449820000},"page":"1145-1167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Congestion games with mixed objectives"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1348-6516","authenticated-orcid":false,"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,10,20]]},"reference":[{"issue":"17","key":"189_CR1","doi-asserted-by":"crossref","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 (2009) Pure nash equilibria in player-specific and weighted congestion games. Theor Comput Sci 410(17):1552\u20131563","journal-title":"Theor Comput Sci"},{"issue":"6","key":"189_CR2","doi-asserted-by":"crossref","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 (2008) On the impact of combinatorial structure on congestion games. J ACM 55(6):25:1\u201325:22","journal-title":"J ACM"},{"issue":"4","key":"189_CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/15427951.2008.10129170","volume":"5","author":"H Ackermann","year":"2008","unstructured":"Ackermann H, Skopalik A (2008) Complexity of pure nash Equilibria in player-specific network congestion games. Internet Math 5(4):323\u2013342","journal-title":"Internet Math"},{"issue":"6","key":"189_CR4","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R Banner","year":"2007","unstructured":"Banner R, Orda A (2007) Bottleneck routing games in communication networks. IEEE J Sel Areas Commun 25(6):1173\u20131179","journal-title":"IEEE J Sel Areas Commun"},{"key":"189_CR5","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Fanelli A, Gravin N, Skopalik A (2011) Efficient Computation of approximate pure Nash equilibria in congestion games. In IEEE 52nd annual symposium on foundations of computer science (FOCS), pp 532\u2013541","DOI":"10.1109\/FOCS.2011.50"},{"issue":"1","key":"189_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2614687","volume":"3","author":"I Caragiannis","year":"2015","unstructured":"Caragiannis I, Fanelli A, Gravin N, Skopalik A (2015) Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Trans Econ Comput 3(1):1\u20132","journal-title":"ACM Trans Econ Comput"},{"issue":"2","key":"189_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S Chien","year":"2011","unstructured":"Chien S, Sinclair A (2011) Convergence to approximate nash equilibria in congestion games. Games Econ Behav 71(2):315\u2013327","journal-title":"Games Econ Behav"},{"issue":"3","key":"189_CR8","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1002\/net.21458","volume":"60","author":"R Cole","year":"2012","unstructured":"Cole R, Dodis Y, Roughgarden T (2012) Bottleneck links, variable demand, and the tragedy of the commons. Networks 60(3):194\u2013203","journal-title":"Networks"},{"issue":"4","key":"189_CR9","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/moor.1080.0322","volume":"33","author":"J Dunkel","year":"2008","unstructured":"Dunkel J, Schulz AS (2008) On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. Math Oper Res 33(4):851\u2013868","journal-title":"Math Oper Res"},{"key":"189_CR10","doi-asserted-by":"crossref","unstructured":"Feldotto M, Gairing M, Skopalik A (2014) Bounding the potential function in congestion games and approximate pure Nash equilibria. In Liu T, Qi Q, Ye Y (eds) Web and internet economics - 10th international conference, WINE 2014, Beijing, China, December 14\u201317, 2014. Proceedings. Lecture Notes in Computer Science, vol 8877, pp 30\u201343. Springer","DOI":"10.1007\/978-3-319-13129-0_3"},{"issue":"2","key":"189_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune S, Hopcroft J, Wyllie J (1980) The directed subgraph homeomorphism problem. Theor Comput Sci 10(2):111\u2013121","journal-title":"Theor Comput Sci"},{"issue":"2","key":"189_CR12","doi-asserted-by":"crossref","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 (2005) Selfish unsplittable flows. Theor Comput Sci 348(2):226\u2013239","journal-title":"Theor Comput Sci"},{"key":"189_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York"},{"key":"189_CR14","unstructured":"Hansknecht C, Klimm M, Skopalik A (2014) Approximate pure Nash equilibria in weighted congestion games. In Jansen K, Rolim JDP, Devanur NR, Moore C (eds) Approximation, randomization, and combinatorial optimization. Algorithms and techniques (APPROX\/RANDOM 2014). Leibniz international proceedings in informatics (LIPIcs), vol\u00a028, pp 242\u2013257. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany"},{"issue":"4","key":"189_CR15","doi-asserted-by":"crossref","first-page":"2553","DOI":"10.1109\/TNET.2015.2468571","volume":"24","author":"T Harks","year":"2016","unstructured":"Harks T, Hoefer M, Schewior K, Skopalik A (2016) Routing games with progressive filling. IEEE\/ACM Trans Netw 24(4):2553\u20132562","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"1","key":"189_CR16","doi-asserted-by":"crossref","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 (2013) Computing pure nash and strong equilibria in bottleneck congestion games. Math Program 141(1):193\u2013215","journal-title":"Math Program"},{"key":"189_CR17","doi-asserted-by":"crossref","unstructured":"Harks T, Klimm M, M\u00f6hring RH (2009) Strong Nash equilibria in games with the lexicographical improvement property. In Leonardi S (ed) Internet and network economics, 5th international workshop, WINE 2009, Rome, Italy, December 14\u201318, 2009. Proceedings. Lecture notes in computer science, vol\u00a05929, pp 463\u2013470. Springer","DOI":"10.1007\/978-3-642-10841-9_43"},{"key":"189_CR18","doi-asserted-by":"crossref","unstructured":"Mavronicolas M, Milchtaich I, Monien B, Tiemann K (2007) Congestion games with player-specific constants. In Kucera L, Kucera A (eds) Mathematical foundations of computer science 2007, 32nd international symposium, MFCS 2007, Cesk\u00fd Krumlov, Czech Republic, August 26\u201331, 2007, Proceedings. Lecture notes in computer science, vol\u00a04708, pp 633\u2013644. Springer","DOI":"10.1007\/978-3-540-74456-6_56"},{"issue":"1","key":"189_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich I (1996) Congestion games with player-specific payoff functions. Games Econ Behav 13(1):111\u2013124","journal-title":"Games Econ Behav"},{"issue":"1","key":"189_CR20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1):124\u2013143","journal-title":"Games Econ Behav"},{"issue":"1","key":"189_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal RW (1973) A class of games possessing pure-strategy nash equilibria. Int J Game Theory 2(1):65\u201367","journal-title":"Int J Game Theory"},{"key":"189_CR22","doi-asserted-by":"crossref","unstructured":"Skopalik A, V\u00f6cking B (2008) Inapproximability of pure Nash equilibria. In Proceedings of the fortieth annual ACM symposium on theory of computing. pp 355\u2013364. STOC \u201908, ACM, New York, NY, USA","DOI":"10.1145\/1374376.1374428"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0189-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0189-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0189-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T18:37:59Z","timestamp":1570214279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0189-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,20]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0189-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,10,20]]}}}