Atomic Routing Games on Maximum Congestion

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

• Type: Conference
• Year: 2006
• Where: AAIM
• Authors: Costas Busch, Malik Magdon-Ismail
• Keywords: AAIM 2006, Algorithms, Atomic Routing Games, Global Maximum Congestion, Maximum Congestion