Tradeoffs in worst-case equilibria

Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsoupias and Papadimitriou to measure the performance degradation due to the lack of a centralized traffic regulating authority. We provide a full characterization of the worst-case coordination ratio in the restricted assignment and unrelated parallel links models. In particular, we quantify the tradeoff between the "negligibility" of the traffic controlled by each user and the coordination ratio. We analyze both pure and mixed strategies systems and identify the range where their performance is similar.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsKlaus Jansen, Roberto Solis-Oba
PublisherSpringer Verlag
Pages41-52
Number of pages12
ISBN (Electronic)3540210792, 9783540210795
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2909
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Tradeoffs in worst-case equilibria'. Together they form a unique fingerprint.

Cite this