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

WorkA New Model for Selfish Routing

Thomas Lücking2004

Work2004

A New Model for Selfish Routing

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

57 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 Transportation Planning and Optimization 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 — 57 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

2007The Price of Selfish Routing 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functions 2008Stackelberg Strategies for Atomic Congestion Games 2004Selfish load balancing and atomic congestion games 2006Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost 2004Selfish Unsplittable Flows

Related works

Explore the map →

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

2008A new model for selfish routingarticle · 24 shared references 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functionsother · 18 shared references 2006Exact Price of Anarchy for Polynomial Congestion Gamesother · 13 shared references 2006On the Price of Stability for Designing Undirected Networks with Fair Cost Allocationsother · 13 shared references 2003Selfish Routing in Non-cooperative Networks: A Surveyother · 13 shared references 2006Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functionsother · 12 shared references

Details

Year2004

Typeother

Published2004-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations57

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/978-3-540-24749-4_48

openalex_workW1532725322

Links

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