On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2005.01.010
@@ Property / DOI: 10.1016/j.ipl.2005.01.010 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.01.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2043166017
@@ Property / OpenAlex ID: W2043166017 / rank @@
+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 @@
+Nash and correlated equilibria: Some complexity considerations
+Normal rank
@@ Property / cites work @@
+Equilibrium Points of Bimatrix Games
@@ Property / cites work: Equilibrium Points of Bimatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Algorithms, games, and the internet
@@ Property / cites work: Algorithms, games, and the internet / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2005.01.010
@@ Property / DOI: 10.1016/J.IPL.2005.01.010 / rank @@
+Normal rank