TY - GEN

T1 - Atomic routing games on maximum congestion

AU - Busch, Costas

AU - Magdon-Ismail, Malik

N1 - Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746266711&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746266711&partnerID=8YFLogxK

U2 - 10.1007/11775096_9

DO - 10.1007/11775096_9

M3 - Conference contribution

AN - SCOPUS:33746266711

SN - 3540351574

SN - 9783540351573

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 79

EP - 91

BT - Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings

PB - Springer Verlag

T2 - 2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006

Y2 - 20 June 2006 through 22 June 2006

ER -