SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

The complexity of computing a Nash equilibrium · Study

PreprintShelves

PreprintThe complexity of computing a Nash equilibrium

Paul W. Goldberg2005

Preprint2005

The complexity of computing a Nash equilibrium

Paul W. Goldberg · Christos H. Papadimitriou

58 citations·0/0 files stored·Electronic colloquium on computational complexity

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Complexity and Algorithms in Graphs Game Theory and Voting Systems

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 58 citations exist upstream.

References

2019Theory of games and economic behavior 1989Non-cooperative games 1994A Course in Game Theory 1964Equilibrium Points of Bimatrix Games 2004The complexity of pure Nash equilibria 2013Graphical Models for Game Theory 1979Equilibrium in supergames with the overtaking criterion 1989Nash and correlated equilibria: Some complexity considerations

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2009Computing equilibria: a computational complexity perspectivearticle · 9 shared references 2013On the Complexity of Approximating a Nash Equilibriumarticle · 8 shared references 2008Well Supported Approximate Equilibria in Bimatrix Gamesarticle · 8 shared references 2008The structure and complexity of Nash equilibria for a selfish routing gamearticle · 7 shared references 2005The Computational Complexity of Nash Equilibria in Concisely Represented Gamesarticle · 7 shared references 2006The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Gamesother · 7 shared references

Details

Year2005

Typepreprint

Published2005-01-01

VenueElectronic colloquium on computational complexity

ISSN-L1433-8092

Languageen

Citations58

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

openalex_workW324981204

Links

landingopen

Imported from OpenAlex (CC0) — nothing here is generated.