Atomic routing games on maximum congestion

Costas Busch, Malik Magdon-Ismail

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is the global maximum congestion over all edges in the network. We show that the price of stability is 1. The price of anarchy, PoA, is determined by topological properties of the network. In particular, PoA = O(ℓ + log n), where ℓ is the length of the longest path in the player strategy sets, and n is the size of the network. Further, κ-1 ≤ PoA ≤ c(κ2 + log2 n), where κ is the length of the longest cycle in the network, and c is a constant.

Original languageEnglish (US)
Title of host publicationAlgorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings
PublisherSpringer Verlag
Pages79-91
Number of pages13
ISBN (Print)3540351574, 9783540351573
DOIs
StatePublished - 2006
Externally publishedYes
Event2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006 - Hong Kong, China
Duration: Jun 20 2006Jun 22 2006

Publication series

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

Conference

Conference2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006
Country/TerritoryChina
CityHong Kong
Period6/20/066/22/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Atomic routing games on maximum congestion'. Together they form a unique fingerprint.

Cite this