SZodixStudyAcademic Library

Shelves Open access

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

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games · Study

WorkPolynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games

Spyros C. Kontogiannis2006

OA

Workbronze2006

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games

Spyros C. Kontogiannis · Panagiota N. Panagopoulou · Paul G. Spirakis

102 citations·0/0 files stored·Lecture notes in computer science

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

References

1951Non-Cooperative Games 1964Equilibrium Points of Bimatrix Games 2006Settling the Complexity of Two-Player Nash Equilibrium 2006The complexity of computing a Nash equilibrium 2003Playing large games using simple strategies 2005Three-Player Games Are Hard 2007Progress in approximate nash equilibria 1994On sparse approximations to randomized strategies and convex combinations

Cited by

2008An Optimization Approach for Approximate Nash Equilibria 2007Computing Equilibria in Anonymous Games 2006A Note on Approximate Nash Equilibria 2013On the Complexity of Approximating a Nash Equilibrium 2009New algorithms for approximate Nash equilibria in bimatrix games 2008The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond 2007New Algorithms for Approximate Nash Equilibria in Bimatrix Games

Related works

Explore the map →

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

2008Well Supported Approximate Equilibria in Bimatrix Gamesarticle · 8 shared references 2009On oblivious PTAS's for nash equilibriumother · 7 shared references 2009New algorithms for approximate Nash equilibria in bimatrix gamesarticle · 7 shared references 2009Computing equilibria: a computational complexity perspectivearticle · 7 shared references 2013On the Complexity of Approximating a Nash Equilibriumarticle · 6 shared references 2007Approximating nash equilibria using small-support strategiesother · 6 shared references

Details

Year2006

Typeother

Published2006-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations102

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/11944874_26

openalex_workW1489801068

Links

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

2008Well Supported Approximate Equilibria in Bimatrix Games