Complexity Results about Nash Equilibria

@inproceedings{Conitzer2002ComplexityRA,
  title={Complexity Results about Nash Equilibria},
  author={Vincent Conitzer and Tuomas Sandholm},
  booktitle={IJCAI},
  year={2002}
}
Noncooperative game theory provides a normative framework for analyzing strategic interactions. However, for the toolbox to be operational, the solutions it defines will have to be computed. In this paper, we provide a single reduction that 1) demonstrates NP-hardness of determining whether Nash equilibria with certain natural properties exist, and 2) demonstrates the #P-hardness of counting Nash equilibria (or connected sets of Nash equilibria). We also show that 3) determining whether a pure… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 156 CITATIONS

Advances in Practical Applications of Survivable Agents and Multi-Agent Systems: The PAAMS Collection

  • Lecture Notes in Computer Science
  • 2019
VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Nash equilibria, gale strings, and perfect matchings

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On Relevant Equilibria in Reachability Games

Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
  • RP
  • 2019
VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Invitation games and the price of stability

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Computing equilibria: a computational complexity perspective

  • Electronic Colloquium on Computational Complexity
  • 2010
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

3-NASH is PPAD-Complete

  • Electronic Colloquium on Computational Complexity
  • 2005
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Distributed Multimedia Information Retrieval

  • Lecture Notes in Computer Science
  • 2003
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2002
2019

CITATION STATISTICS

  • 19 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Artificial Intelligence

Laszlo Mero. A Heuristic Search Algorithm with Modifiable Estimate
  • 23(1):13–27,
  • 1984
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

IEEE Transactions of Systems Science and Cybernetics

Peter Hart, Nils Nilsson, Bertram Raphael. A Formal Basis for the Heuristic Determin Paths
  • SSC-4(2):100–107,
  • 1968
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

In IJCAI

Ariel Felner, Uzi Zahavi, Jonathan Schaeffer, Robert Holte. Dual Lookups in Pattern Databases
  • pages 103–108,
  • 2005
VIEW 1 EXCERPT

Journal of the ACM

Amitava Bagchi, Ambuj Mahanti. Search Algorithms Under Different Kinds o Study
  • 30(1):1–21,
  • 1983
VIEW 1 EXCERPT

Artificial Intelligence

Alberto Martelli. On the Complexity of Admissible Search Algorithms
  • 8(1):1–13,
  • 1977

Bagchi and Mahanti , 1983 ] Amitava Bagchi and Ambuj Mahanti . Search Algorithms Under Different Kinds of Heuristics - A Comparative Study

Peter Hart, Nils Nilsson, Bertram Raphael