{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:43:40Z","timestamp":1725497020879},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771043"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_47","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:59:37Z","timestamp":1196665177000},"page":"419-430","source":"Crossref","is-referenced-by-count":11,"title":["On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games"],"prefix":"10.1007","author":[{"given":"Heiner","family":"Ackermann","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613\u2013622 (2006)","key":"47_CR1","DOI":"10.1109\/FOCS.2006.55"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11944874_6","volume-title":"Internet and Network Economics","author":"H. Ackermann","year":"2006","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 50\u201361. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 295\u2013304 (2004)","key":"47_CR3","DOI":"10.1109\/FOCS.2004.68"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1064009.1064015","volume-title":"Proc. of the 6th ACM conference on Electronic Commerce (EC)","author":"D. Chakrabarty","year":"2005","unstructured":"Chakrabarty, D., Mehta, A., Nagarajan, V.: Fairness and optimality in congestion games. In: Proc. of the 6th ACM conference on Electronic Commerce (EC), pp. 52\u201357. ACM Press, New York (2005)"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/11944874_7","volume-title":"Internet and Network Economics","author":"J. Dunkel","year":"2006","unstructured":"Dunkel, J., Schulz, A.S.: On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 62\u201373. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604\u2013612 (2004)","key":"47_CR6","DOI":"10.1145\/1007352.1007445"},{"key":"47_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"47_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimtriou, C.H., Yannakakis, M.: How easy is local search? Journal on Computer and System Sciences\u00a037(1), 79\u2013100 (1988)","journal-title":"Journal on Computer and System Sciences"},{"unstructured":"Meyers, C.: Network Flow Problems and Congestion Games: Complexitiy and Approximation. Massachusetts Institute of Technology (2006)","key":"47_CR9"},{"issue":"1","key":"47_CR10","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 and Economic Behavior\u00a013(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"47_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11944874_9","volume-title":"Internet and Network Economics","author":"I. Milchtaich","year":"2006","unstructured":"Milchtaich, I.: The equilibrium existence problem in finite network congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 87\u201398. Springer, Heidelberg (2006)"},{"unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (forthcoming)","key":"47_CR12"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Int. Journal of Game Theory"},{"issue":"1","key":"47_CR14","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A.A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM Journal on Computing\u00a020(1), 56\u201387 (1991)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:32Z","timestamp":1619521232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_47","relation":{},"subject":[]}}