Zero-Sum Polymatrix Games: A Generalization of Minmax (Q2806824): Difference between revisions

@@ Property / DOI @@
-.1287/moor.2015.0745
@@ Property / DOI: 10.1287/moor.2015.0745 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2288719682
@@ Property / OpenAlex ID: W2288719682 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Strictly Competitive Games
@@ Property / cites work: A Note on Strictly Competitive Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q3786311
@@ Property / cites work: Q3786311 / rank @@
+Normal rank
@@ Property / cites work @@
+On separable non-cooperative zero-sum games
@@ Property / cites work: On separable non-cooperative zero-sum games / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365039
@@ Property / cites work: Q5365039 / rank @@
+Normal rank
@@ Property / cites work @@
+Prediction, Learning, and Games
@@ Property / cites work: Prediction, Learning, and Games / 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 @@
+Adaptive game playing using multiplicative weights
+Normal rank
@@ Property / cites work @@
+Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
+Normal rank
@@ Property / DOI @@
+.1287/MOOR.2015.0745
@@ Property / DOI: 10.1287/MOOR.2015.0745 / rank @@
+Normal rank