SZodixStudyAcademic Library

Shelves Open access

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

Stackelberg Strategies for Atomic Congestion Games · Study

ArticleShelves

ArticleStackelberg Strategies for Atomic Congestion Games

Dimitris A. Fotakis2008

OA

Articlegreen2008

Stackelberg Strategies for Atomic Congestion Games

Dimitris A. Fotakis

54 citations·0/0 files stored·Theory of Computing Systems

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 Optimization and Search Problems

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

References

1973A class of games possessing pure-strategy Nash equilibria 1999Worst-Case Equilibria 2005The price of anarchy of finite congestion games 2003The price of anarchy is independent of the network topology 2004Selfish Routing in Capacitated Networks 2005The Price of Routing Unsplittable Flow 1997Achieving network optima using Stackelberg routing strategies 2004Stackelberg Scheduling Strategies

Cited by

2010Stackelberg Strategies and Collusion in Network Games with Splittable Flow 2012The effectiveness of stackelberg strategies and tolls for network congestion games 2017A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games

Related works

Explore the map →

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

2009Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchyarticle · 10 shared references 2010Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightnessother · 8 shared references 2010Stackelberg Strategies and Collusion in Network Games with Splittable Flowarticle · 8 shared references 2009Efficient coordination mechanisms for unrelated machine schedulingother · 8 shared references 2007Total Latency in Singleton Congestion Gamesother · 8 shared references 2010On the Performance of Approximate Equilibria in Congestion Gamesarticle · 7 shared references

Details

Year2008

Typearticle

Published2008-10-24

VenueTheory of Computing Systems

ISSN-L0025-5661

Languageen

Citations54

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/s00224-008-9152-8

openalex_workW1965228255

Links

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