The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games

@inproceedings{Daskalakis2006TheGW,
  title={The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games},
  author={Constantinos Daskalakis and Alex Fabrikant and Christos H. Papadimitriou},
  booktitle={ICALP},
  year={2006}
}
A recent sequence of results established that computing Nash equilibria in normal form games is a PPAD-complete problem even in the case of two players [11,6,4]. By extending these techniques we prove a general theorem, showing that, for a far more general class of families of succinctly representable multiplayer games, the Nash equilibrium problem can also be reduced to the twoplayer case. In view of empirically successful algorithms available for this problem, this is in essence a positive… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
26 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Nash and Walras Equilibrium via Brouwer,

  • J. Geanakoplos
  • Economic Theory,
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…