SZodixStudyAcademic Library

Shelves Open access

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

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games · Study

WorkEfficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

Spyros C. Kontogiannis2007

Work2007

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

Spyros C. Kontogiannis · Paul G. Spirakis

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

References

1951Non-Cooperative Games 1964Equilibrium Points of Bimatrix Games 2001Algorithms, games, and the internet 2006Settling the Complexity of Two-Player Nash Equilibrium 2006The complexity of computing a Nash equilibrium 1989Nash and correlated equilibria: Some complexity considerations 2003Playing large games using simple strategies 2005Internet and Network Economics

Cited by

2012Approximate Well-Supported Nash Equilibria Below Two-Thirds

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 · 14 shared references 2009Computing equilibria: a computational complexity perspectivearticle · 10 shared references 2013On the Complexity of Approximating a Nash Equilibriumarticle · 9 shared references 2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Gamesother · 8 shared references 2009New algorithms for approximate Nash equilibria in bimatrix gamesarticle · 8 shared references 2007New Algorithms for Approximate Nash Equilibria in Bimatrix Gamesother · 8 shared references

Details

Year2007

Typeother

Published2007-08-25

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations34

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/978-3-540-73420-8_52

openalex_workW1520466390

Links

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