Zero-Sum Polymatrix Games: A Generalization of Minmax
Published Online:27 Jan 2016https://doi.org/10.1287/moor.2015.0745
References
- (2009) A note on strictly competitive games. Leonardi S, ed. Proc. 5th Workshop on Internet and Network Econom. (WINE) (Springer, Berlin).Crossref, Google Scholar
- (1987) Game theory. Eatwell J, Milgate M, Newman P, eds. The New Palgrave: A Dictionary of Economics (Macmillan, London), 460–482.Crossref, Google Scholar
- (1987) Methods of determining equilibrium situations in zero-sum polymatrix games. Optimizatsia (in Russian) 40(57):70–82.Google Scholar
- (1998) On separable non-cooperative zero-sum games. Optim. 44(1):69–84.Crossref, Google Scholar
- (2011) A minmax theorem for multiplayer zero-sum games. Proc. 22nd ACM-SIAM Sympos. Discrete Algorithms, SODA ’11 (SIAM, Philadelphia).Crossref, Google Scholar
- (2006) Prediction, Learning, and Games (Cambridge University Press, New York).Crossref, Google Scholar
- (2006) Computing Nash equilibria: Approximation and smoothed complexity. Proc. 47th Annual IEEE Sympos. Foundations Comput. Sci. FOCS ’06) (IEEE, Piscataway, NJ).Crossref, Google Scholar
- (2006) The complexity of computing a Nash equilibrium. Proc. 38th Annual ACM Sympos. Theory Comput. STOC ’06 (ACM, New York).Crossref, Google Scholar
- (2009) On a network generalization of the minmax theorem. Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas S, Thomas W, eds. Proc. 36th Internat. Colloquium on Automata, Languages and Programming ICALP ’09 (Springer, Berlin).Crossref, Google Scholar
- (1999) Adaptive game playing using multiplicative weights. Games Econom. Behav. 29(1-2):79–103.Crossref, Google Scholar
- (1978) Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon. Internat. J. Game Theory 7(3–4):201–221.Crossref, Google Scholar
- (1928) Zur Theorie der Gesellshaftsspiele. Mathematische Annalen 100:295–320.Crossref, Google Scholar

