Single parameter FPT-algorithms for non-trivial games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6460 LNCS, Issue , 2011, Pages 121-124

  Estivill Castro, Vladimir ^a   Parsa, Mahdi ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Algorithmic Game Theory; Computational Complexity

Indexed keywords

ALGORITHMIC GAME THEORY; FIXED-PARAMETER ALGORITHMS; NASH EQUILIBRIA; NASH EQUILIBRIUM; NON-TRIVIAL; NP COMPLETE; SINGLE PARAMETER;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; PARAMETER ESTIMATION; TELECOMMUNICATION NETWORKS;

GAME THEORY;

EID: 79953223726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19222-7_13     Document Type: Conference Paper

References (13)

1. 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-122. IEEE Computer Society Press, Los Alamitos (2005)
2. Bonifaci, V., Iorio, U.D., Laura, L.: The complexity of uniform Nash equilibria and related regular subgraph problems. Theoretical Computer Science 401(1-3), 144-152 (2008)
3. 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 201(2), 216-231 (2005)
4. 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. 4286, pp. 262-273. Springer, Heidelberg (2006)
5. Codenotti, B., Stefankovic, D.: On the computational complexity of Nash equilibria for (0,1) bimatrix games. Information Processing Letters 94, 145-150 (2005)
6. 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-771. Morgan Kaufmann, Acapulco (2003)
7. Estivill-Castro, V., Parsa, M.: The parameterized complexity of uniform Nash equilibria in win-lose games (submitted for publication)
8. Estivill-Castro, V., Parsa, M.: Computing Nash equilibria gets harder - new results show hardness even for parameterized complexity. In: Downey, R., Manyem, P. (eds.) The Australasian Theory Symposium (CATS 2009). CRPIT, vol. 94. Australian Computer Society, Inc., Wellington (2009)
9. 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 410(36), 3305-3326 (2009)
10. 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 410(47-49), 4989-4999 (2009)
11. Gilboa, I., Zemel, E.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior 1(1), 80-93 (1989)
12. Hermelin, D., Huang, C.C., Kratsch, S., Wahlstrom, M.: Parameterized two-player Nash equilibrium, personal communication
13. von Stengel, B.: Computing equilibria for two-person games. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory. ch.45, vol. 3, pp. 1723-1759. Elsevier, Amsterdam (2002)