SZodixStudyAcademic Library

Shelves Open access

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

A new model for selfish routing · Study

ArticleShelves

ArticleA new model for selfish routing

Thomas Lücking2008

OA

Articlebronze2008

A new model for selfish routing

Thomas Lücking · Marios Mavronicolas B · Burkhard Monien · Manuel Rode

55 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 Network Traffic and Congestion Control Complexity and Algorithms in Graphs

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

References

1950Equilibrium points in n -person games 1951Non-Cooperative Games 1989Non-cooperative games 1994A Course in Game Theory 1973A class of games possessing pure-strategy Nash equilibria 1999Worst-Case Equilibria 1956Studies in the Economics of Transportation.1957Studies in the Economics of Transportation.

Cited by

2008Stackelberg Strategies for Atomic Congestion Games 2010Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness 2011The Robust Price of Anarchy of Altruistic Games

Related works

Explore the map →

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

2004A New Model for Selfish Routingother · 24 shared references 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functionsother · 20 shared references 2006Exact Price of Anarchy for Polynomial Congestion Gamesother · 16 shared references 2006On the Price of Stability for Designing Undirected Networks with Fair Cost Allocationsother · 13 shared references 2006Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functionsother · 13 shared references 2009The Impact of Oligopolistic Competition in Networksarticle · 12 shared references

Details

Year2008

Typearticle

Published2008-07-02

VenueTheoretical Computer Science

ISSN-L0304-3975

Languageen

Citations55

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1016/j.tcs.2008.06.045

openalex_workW2075004702

Links

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