Abstract
We consider graphical games in which the edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. Such games are arguably very broad and useful models of networked economic interactions. We give a simple reduction of such games to two-person zero-sum games; as a corollary, a mixed Nash equilibrium can be computed efficiently by solving a linear program and rounding off the results. Our results render polynomially efficient, and simplify considerably, the approach in [3].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, I., Daskalakis, C., Papadimitriou, C.H. (manuscript, 2009)
Aumann, R.J.: Game Theory. In: Eatwell, J., Milgate, M., Newman, P. (eds.) The New Palgrave: A Dictionary of Economics, Macmillan & Co., London (1987)
Bregman, L.M., Fokin, I.N.: On Separable Non-Cooperative Zero-Sum Games. Optimization 44(1), 69–84 (1998)
Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. In: STOC (2006); SIAM Journal on Computing, special issue for STOC 2006 (to appear)
Freund, Y., Schapire, R.E.: Adaptive Game Playing Using Multiplicative Weights. Games and Economic Behavior 29, 79–103 (1999)
Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical Models for Game Theory. In: UAI (2001)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the Spread of Influence through a Social Network. In: SIGKDD (2003)
von Neumann, J.: Zur Theorie der Gesellschaftsspiele. Math. Annalen 100, 295–320 (1928)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daskalakis, C., Papadimitriou, C.H. (2009). On a Network Generalization of the Minmax Theorem. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-02930-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02929-5
Online ISBN: 978-3-642-02930-1
eBook Packages: Computer ScienceComputer Science (R0)