Single Parameter FPT-Algorithms for Non-trivial Games

DOI10.1007/978-3-642-19222-7_13zbMath1326.68156OpenAlexW2398380006WikidataQ58803152 ScholiaQ58803152MaRDI QIDQ3000500

Mahdi Parsa, Vladimir Estivill-Castro

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/39590

zbMATH Keywords

computational complexityalgorithmic game theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Parameterized two-player Nash equilibrium ⋮ Pure Nash equilibria in graphical games and treewidth

Cites Work

• The structure and complexity of Nash equilibria for a selfish routing game
• New complexity results about Nash equilibria
• The complexity of uniform Nash equilibria and related regular subgraph problems
• How hard is it to find extreme Nash equilibria in network congestion games?
• On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
• Nash and correlated equilibria: Some complexity considerations
• Tight lower bounds for certain parameterized NP-hard problems

This page was built for publication: Single Parameter FPT-Algorithms for Non-trivial Games