{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:58Z","timestamp":1725869518161},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_47","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"655-669","source":"Crossref","is-referenced-by-count":3,"title":["Congestion Games with Mixed Objectives"],"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":[[2016,10,31]]},"reference":[{"issue":"17","key":"47_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.: 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":"47_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.: 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":"47_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.: Complexity of pure nash equilibria in player-specific network congestion games. Internet Math. 5(4), 323\u2013342 (2008)","journal-title":"Internet Math."},{"issue":"6","key":"47_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.: Bottleneck routing games in communication networks. IEEE J. Sel. Areas Commun. 25(6), 1173\u20131179 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"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), pp. 532\u2013541 (2011)","key":"47_CR5","DOI":"10.1109\/FOCS.2011.50"},{"issue":"1","key":"47_CR6","doi-asserted-by":"crossref","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":"47_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.: Convergence to approximate nash equilibria in congestion games. Games Econ. Behav. 71(2), 315\u2013327 (2011)","journal-title":"Games Econ. Behav."},{"issue":"3","key":"47_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.: Bottleneck links, variable demand, and the tragedy of the commons. Networks 60(3), 194\u2013203 (2012)","journal-title":"Networks"},{"issue":"4","key":"47_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, 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":"47_CR10","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, Heidelberg (2014). doi: 10.1007\/978-3-319-13129-0_3"},{"issue":"2","key":"47_CR11","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.: Selfish unsplittable flows. Theoret. Comput. Sci. 348(2), 226\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"47_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"unstructured":"Hansknecht, C., Klimm, M., Skopalik, A.: Approximate pure nash equilibria in weighted congestion games. In: Jansen, K., Rolim, J.D.P., Devanur, N.R., Moore, C. (eds.) Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques (APPROX\/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol. 28, pp. 242\u2013257. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2014)","key":"47_CR13"},{"issue":"4","key":"47_CR14","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.: Routing games with progressive filling. IEEE\/ACM Trans. Netw. 24(4), 2553\u20132562 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"47_CR15","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.: Computing pure nash and strong equilibria in bottleneck congestion games. Math. Program. 141(1), 193\u2013215 (2013)","journal-title":"Math. Program."},{"key":"47_CR16","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":"47_CR17","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":"47_CR18","doi-asserted-by":"crossref","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":"47_CR19","doi-asserted-by":"crossref","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":"47_CR20","doi-asserted-by":"crossref","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 Theor. 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theor."},{"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)","key":"47_CR21","DOI":"10.1145\/1374376.1374428"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:24:37Z","timestamp":1498343077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}