The Complexity of Nash Equilibria in Infinite Multiplayer Games (Q5458348): Difference between revisions

@@ Property / cites work @@
+Q3956774
@@ Property / cites work: Q3956774 / rank @@
+Normal rank
@@ Property / cites work @@
+DAG-Width and Parity Games
@@ Property / cites work: DAG-Width and Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing a Nash equilibrium
@@ Property / cites work: The complexity of computing a Nash equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Q5817866
@@ Property / cites work: Q5817866 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934648
@@ Property / cites work: Q2934648 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
+Normal rank
@@ Property / cites work @@
+Borel determinacy
@@ Property / cites work: Borel determinacy / rank @@
+Normal rank
@@ Property / cites work @@
+DAG-width
@@ Property / cites work: DAG-width / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width and Parity Games
@@ Property / cites work: Clique-Width and Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576736
@@ Property / cites work: Q3576736 / rank @@
+Normal rank
@@ Property / cites work @@
+Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
+Normal rank
@@ Property / cites work @@
+Infinite games on finitely coloured graphs with applications to automata on infinite trees
+Normal rank