Single Parameter FPT-Algorithms for Non-trivial Games (Q3000500): Difference between revisions

@@ Property / author @@
-Vladimir Estivill-Castro
@@ Property / author: Vladimir Estivill-Castro / rank @@
-Normal rank
@@ Property / author @@
+Vladimir Estivill-Castro
@@ Property / author: Vladimir Estivill-Castro / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2398380006
@@ Property / OpenAlex ID: W2398380006 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58803152
@@ Property / Wikidata QID: Q58803152 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of uniform Nash equilibria and related regular subgraph problems
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
+Normal rank
@@ Property / cites work @@
+New complexity results about Nash equilibria
@@ Property / cites work: New complexity results about Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+The structure and complexity of Nash equilibria for a selfish routing game
+Normal rank
@@ Property / cites work @@
+How hard is it to find extreme Nash equilibria in network congestion games?
+Normal rank
@@ Property / cites work @@
+Nash and correlated equilibria: Some complexity considerations
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3000500