SZodixStudyAcademic Library

Shelves Open access

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

An Optimization Approach for Approximate Nash Equilibria · Study

WorkAn Optimization Approach for Approximate Nash Equilibria

Haralampos Tsaknakis2007

Work2007

An Optimization Approach for Approximate Nash Equilibria

Haralampos Tsaknakis · Paul G. Spirakis

105 citations·0/0 files stored·Springer eBooks

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

References

2006Settling the Complexity of Two-Player Nash Equilibrium 2007Progress in approximate nash equilibria 2008A note on approximate Nash equilibria 2018Mixed-Integer Programming Methods for Finding Nash Equilibria

Cited by

2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games 2009On oblivious PTAS's for nash equilibrium 2013On the Complexity of Approximating a Nash Equilibrium 2009New algorithms for approximate Nash equilibria in bimatrix games 2010On the Performance of Approximate Equilibria in Congestion Games 2009Computing equilibria: a computational complexity perspective 2008Well Supported Approximate Equilibria in Bimatrix Games 2008Discretized multinomial distributions and Nash equilibria in anonymous games

Related works

Explore the map →

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

2008An Optimization Approach for Approximate Nash Equilibriaarticle · 3 shared references 2007New Algorithms for Approximate Nash Equilibria in Bimatrix Gamesother · 3 shared references 2014On the communication complexity of approximate Nash equilibriaarticle · 3 shared references 2008A note on approximate Nash equilibriaarticle · 2 shared references 2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Gamesother · 2 shared references 2007Lossless abstraction of imperfect information gamesarticle · 2 shared references

Details

Year2007

Typeother

Published2007-12-03

VenueSpringer eBooks

Languageen

Citations105

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/978-3-540-77105-0_8

openalex_workW2179957089

Links

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