SZodixStudyAcademic Library

Shelves Open access

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

Convergence to approximate Nash equilibria in congestion games · Study

ArticleShelves

ArticleConvergence to approximate Nash equilibria in congestion games

Steve Chien2009

Article2009

Convergence to approximate Nash equilibria in congestion games

Steve Chien · Alistair Sinclair

121 citations·0/0 files stored·Games and Economic Behavior

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

References

1950Equilibrium points in n -person games 1973A class of games possessing pure-strategy Nash equilibria 1956Studies in the Economics of Transportation.1957Studies in the Economics of Transportation.2001Algorithms, games, and the internet 2006Selfish Routing and the Price of Anarchy 2004The complexity of pure Nash equilibria 1996Congestion Games with Player-Specific Payoff Functions

Cited by

2011Distributed algorithms via gradient descent for fisher markets 2008Inapproximability of pure nash equilibria 2007Computing Equilibria in Anonymous Games 2014Approximate Nash equilibria in anonymous games 2012A Game-Theoretic Analysis of a Competitive Diffusion Process over Social Networks 2008Fast-converging tatonnement algorithms for one-time and ongoing market problems 2010

Related works

Explore the map →

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

2010On the Performance of Approximate Equilibria in Congestion Gamesarticle · 14 shared references 2007Convergence to approximate Nash equilibria in congestion gamesother · 13 shared references 2006Exact Price of Anarchy for Polynomial Congestion Gamesother · 11 shared references 2008Fast convergence to nearly optimal solutions in potential gamesother · 10 shared references 2009Computing equilibria: a computational complexity perspectivearticle · 10 shared references 2008A new model for selfish routingarticle · 10 shared references

Details

Year2009

Typearticle

Published2009-05-23

VenueGames and Economic Behavior

ISSN-L0899-8256

Languageen

Citations121

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1016/j.geb.2009.05.004

openalex_workW1990873282

Links

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

Strategic Interaction and Networks

2011Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games