SZodixStudyAcademic Library

Shelves Open access

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

The structure and complexity of Nash equilibria for a selfish routing game · Study

ArticleShelves

ArticleThe structure and complexity of Nash equilibria for a selfish routing game

Dimitris A. Fotakis2008

OA

Articlebronze2008

The structure and complexity of Nash equilibria for a selfish routing game

Dimitris A. Fotakis · Spyros C. Kontogiannis · Elias Koutsoupias · Marios Mavronicolas B · Paul G. Spirakis

89 citations·0/0 files stored·Theoretical 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 — 89 citations exist upstream.

References

1951Non-Cooperative Games 1989Non-cooperative games 1994A Course in Game Theory 1996Potential Games 1999Worst-Case Equilibria 1964Equilibrium Points of Bimatrix Games 2001Algorithms, games, and the internet 1974The Computation of Economic Equilibria.

Cited by

2007Congestion Games with Player-Specific Constants 2012Optimal Cost Sharing for Resource Selection Games 2011Competitive routing over time 2010On the Existence of Pure Nash Equilibria in Weighted Congestion Games 2014On Nash Equilibria for a Network Creation Game

Related works

Explore the map →

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

2009Computing equilibria: a computational complexity perspectivearticle · 11 shared references 2004Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Gameother · 10 shared references 2006Exact Price of Anarchy for Polynomial Congestion Gamesother · 10 shared references 2008A new model for selfish routingarticle · 9 shared references 2003Pure Nash equilibriaother · 9 shared references 2004Nash Equilibria via Polynomial Equationsother · 9 shared references

Details

Year2008

Typearticle

Published2008-01-14

VenueTheoretical Computer Science

ISSN-L0304-3975

Languageen

Citations89

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1016/j.tcs.2008.01.004

openalex_workW2018136046

Links

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