Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity

@inproceedings{EstivillCastro2009ComputingNE,
  title={Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity},
  author={Vladimir Estivill-Castro and Mahdi Parsa},
  booktitle={CATS},
  year={2009}
}
In this paper we show that some decision problems regarding the computation of Nash equilibria are to be considered particularly hard. Most decision problems regarding Nash equilibria have been shown to be NP-complete. While some NP-complete problems can find an alternative to tractability with the tools of Parameterized Complexity Theory, it is also the case that some classes of problems do not seem to have fixed-parameter tractable algorithms. We show that k-Uniform Nash and k-Minimal Nash… CONTINUE READING

References

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

Invitation to FixedParameter

R. Niedermeier
2006
View 5 Excerpts
Highly Influenced

Nash and Correlated Equilibria : Some Complexity Considerations

ITZHAKGILBOAAND EITAN ZEMEL
2003
View 15 Excerpts
Highly Influenced

Parameterized Complexity

Monographs in Computer Science • 1999
View 7 Excerpts
Highly Influenced

Simple complexity from imitation games

Games and Economic Behavior • 2010
View 7 Excerpts
Highly Influenced

Algorithms for Playing Games with Limited Randomness

Electronic Colloquium on Computational Complexity • 2007
View 1 Excerpt

The complexity of finding Nash equilibria

C. H. Papadimitriou
2007
View 1 Excerpt

Similar Papers

Loading similar papers…