On a Network Generalization of the Minmax Theorem

@inproceedings{Daskalakis2009OnAN,
  title={On a Network Generalization of the Minmax Theorem},
  author={Constantinos Daskalakis and Christos H. Papadimitriou},
  booktitle={ICALP},
  year={2009}
}
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… CONTINUE READING

From This Paper

Topics from this paper.
18 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

and C

  • I. Adler, C. Daskalaki
  • H. Papadimitriou, manuscript,
  • 2009
2 Excerpts

Tardos “ Maximizing the Spread of Influence through a Social Network

  • J. Kleinberg, É.
  • Proc . 9 th ACM SIGKDD Intl . Conf . on Knowledge…
  • 2003

On Separable Non-Cooperative Zero-Sum Games

  • L. M. Bregman, I. N. Fokin
  • Optimization, 44(1):69–84,
  • 1998
2 Excerpts

Aumann “ Game Theory

  • J. R.
  • The New Palgrave : A Dictionary of Economics
  • 1987

Game Theory

  • R. J. Aumann
  • The New Palgrave: A Dictionary of Economics by J…
  • 1987
1 Excerpt

von Neumann “ Zur Theorie der Gesellschaftsspiele

  • J.
  • Math . Annalen
  • 1928

Similar Papers

Loading similar papers…