{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:32Z","timestamp":1725579032019},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_13","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"121-124","source":"Crossref","is-referenced-by-count":3,"title":["Single Parameter FPT-Algorithms for Non-trivial Games"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Estivill-Castro","sequence":"first","affiliation":[]},{"given":"Mahdi","family":"Parsa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"113","volume-title":"46th Annual IEEE Symp. on Foundations of Computer Science, FOCS 2005","author":"T. Abbott","year":"2005","unstructured":"Abbott, T., Kane, D., Valiant, P.: On the complexity of two-player win-lose games. In: 46th Annual IEEE Symp. on Foundations of Computer Science, FOCS 2005, pp. 113\u2013122. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"1-3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.tcs.2008.03.036","volume":"401","author":"V. Bonifaci","year":"2008","unstructured":"Bonifaci, V., Iorio, U.D., Laura, L.: The complexity of uniform Nash equilibria and related regular subgraph problems. Theoretical Computer Science\u00a0401(1-3), 144\u2013152 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J. Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., Xia, X.: Tight lower bounds for certain parameterized NP-hard problems. Information and Computation\u00a0201(2), 216\u2013231 (2005)","journal-title":"Information and Computation"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11944874_24","volume-title":"Internet and Network Economics","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Sparse games are hard. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 262\u2013273. Springer, Heidelberg (2006)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ipl.2005.01.010","volume":"94","author":"B. Codenotti","year":"2005","unstructured":"Codenotti, B., Stefankovic, D.: On the computational complexity of Nash equilibria for (0,1) bimatrix games. Information Processing Letters\u00a094, 145\u2013150 (2005)","journal-title":"Information Processing Letters"},{"key":"13_CR6","first-page":"765","volume-title":"18th Int. Joint Conf. on Artificial Intelligence, IJCAI 2003","author":"V. Conitzer","year":"2003","unstructured":"Conitzer, V., Sandholm, T.: Complexity results about Nash equilibria. In: Gottlob, G., Walsh, T. (eds.) 18th Int. Joint Conf. on Artificial Intelligence, IJCAI 2003, pp. 765\u2013771. Morgan Kaufmann, Acapulco (2003)"},{"key":"13_CR7","unstructured":"Estivill-Castro, V., Parsa, M.: The parameterized complexity of uniform Nash equilibria in win-lose games (submitted for publication)"},{"key":"13_CR8","series-title":"CRPIT","volume-title":"The Australasian Theory Symposium (CATS 2009)","author":"V. Estivill-Castro","year":"2009","unstructured":"Estivill-Castro, V., Parsa, M.: Computing Nash equilibria gets harder\u2014 new results show hardness even for parameterized complexity. In: Downey, R., Manyem, P. (eds.) The Australasian Theory Symposium (CATS 2009). CRPIT, vol.\u00a094. Australian Computer Society, Inc., Wellington (2009)"},{"issue":"36","key":"13_CR9","doi-asserted-by":"publisher","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","volume":"410","author":"D. Fotakis","year":"2009","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. Theoretical Computer Science\u00a0410(36), 3305\u20133326 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"47-49","key":"13_CR10","doi-asserted-by":"publisher","first-page":"4989","DOI":"10.1016\/j.tcs.2009.07.046","volume":"410","author":"E. Gassner","year":"2009","unstructured":"Gassner, E., Hatzl, J., Krumke, S., Sperber, H., Woeginger, G.: How hard is it to find extreme Nash equilibria in network congestion games?. Theoretical Computer Science\u00a0410(47-49), 4989\u20134999 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I. Gilboa","year":"1989","unstructured":"Gilboa, I., Zemel, E.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior\u00a01(1), 80\u201393 (1989)","journal-title":"Games and Economic Behavior"},{"key":"13_CR12","unstructured":"Hermelin, D., Huang, C.C., Kratsch, S., Wahlstrom, M.: Parameterized two-player Nash equilibrium, personal communication"},{"key":"13_CR13","series-title":"ch.45","first-page":"1723","volume-title":"Handbook of Game Theory","author":"B. Stengel von","year":"2002","unstructured":"von Stengel, B.: Computing equilibria for two-person games. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory. ch.45, vol.\u00a03, pp. 1723\u20131759. Elsevier, Amsterdam (2002)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:28:15Z","timestamp":1558420095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}