SZodixStudyAcademic Library

Shelves Open access

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

Three-Player Games Are Hard · Study

ArticleShelves

ArticleThree-Player Games Are Hard

Constantinos Daskalakis2005

Article2005

Three-Player Games Are Hard

Constantinos Daskalakis · Christos H. Papadimitriou

150 citations·0/0 files stored

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

We prove that computing a Nash equilibrium in a 3-player game is PPAD-complete, solving a problem left open in (2).

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 — 150 citations exist upstream.

References

2013Graphical Models for Game Theory

Cited by

2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games 2007The Complexity of Finding Nash Equilibria 2009On oblivious PTAS's for nash equilibrium 2013On the Complexity of Approximating a Nash Equilibrium 2006Computing pure nash equilibria in graphical games via markov random fields 2009Computing equilibria: a computational complexity perspective 2005The complexity of computing a Nash equilibrium 2005The Computational Complexity of Nash Equilibria in Concisely Represented Games

Related works

Explore the map →

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

2006Settling the Complexity of Two-Player Nash Equilibriumother · 1 shared reference 2006Computing the optimal strategy to commit toother · 1 shared reference 2006The complexity of computing a Nash equilibriumother · 1 shared reference 2003Multi-agent influence diagrams for representing and solving gamesarticle · 1 shared reference 2014Games on Networkschapter · 1 shared reference 2005Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibriaarticle · 1 shared reference

Details

Year2005

Typearticle

Published2005-01-01

Languageen

Citations150

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

openalex_workW2170677670

Links

landingopen

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