Single Parameter FPT-Algorithms for Non-trivial Games
From MaRDI portal
Publication:3000500
DOI10.1007/978-3-642-19222-7_13zbMath1326.68156WikidataQ58803152 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
68Q25: Analysis of algorithms and problem complexity
91A10: Noncooperative games
91A05: 2-person games
91A43: Games involving graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
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