{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:23Z","timestamp":1742913503020,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95891-8_38","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T01:19:21Z","timestamp":1232587161000},"page":"413-424","source":"Crossref","is-referenced-by-count":0,"title":["$\\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games"],"prefix":"10.1007","author":[{"given":"Nguyen Kim","family":"Thang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceeding of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 511\u2013520 (2003)","DOI":"10.1145\/780615.780617"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1111\/j.1467-8640.1996.tb00256.x","volume":"12","author":"J.R.S. Blair","year":"1996","unstructured":"Blair, J.R.S., Mutchler, D., Van Lent, M.: Perfect recall and pruning in games with imperfect information. Computational Intelligence\u00a012, 131\u2013154 (1996)","journal-title":"Computational Intelligence"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-Cooperative Multicast and Facility Location Games. In: Proceedings of the 7th ACM Conference on Electronic Commerce (EC), pp. 72\u201381 (2006)","DOI":"10.1145\/1134707.1134716"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Roughgarden, T.: Network Design with Weighted Players. In: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 29\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"38_CR6","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing Networks with Good Equilibria. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2008)"},{"key":"38_CR7","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)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-75520-3_4","volume-title":"Algorithms \u2013 ESA 2007","author":"C. D\u00fcrr","year":"2007","unstructured":"D\u00fcrr, C., Thang, N.K.: Nash equilibria in voronoi games on graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 17\u201328. Springer, Heidelberg (2007)"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibrium in load balancing. ACM Transactions on Algorithms\u00a03(3) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"38_CR11","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"38_CR12","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 and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"38_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"38_CR14","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. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T08:22:19Z","timestamp":1558081339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}