We study Network Maximum Congestion Games, a class of network games where players choose a path between two given nodes in order to minimize the congestion of the bottleneck (the most congested link) of their path. For single-commodity games, we provide an algorithm which computes a Pure Nash Equilibrium in polynomial time. If all players have the same weight, the obtained equilibrium has optimum social cost. If players are allowed to have different weights, the obtained equilibrium has social cost at most 4/3 times worst than the optimum. For multi-commodity games with a fixed number of commodities and a particular graph topology, we also provide an algorithm which computes a Pure Nash Equilibria in polynomial time. We also study some issues related to the quality of the equilibria in this kind of games. ; Postprint (published version)
Maximum congestion games on networks: How can we compute their equilibria?
2007-09-01
LSI-07-30-R
Paper
Elektronische Ressource
Englisch
DDC: | 629 |
Risk-Averse Equilibria for Vehicle Navigation in Stochastic Congestion Games
IEEE | 2022
|Equilibrium Results for Dynamic Congestion Games
British Library Online Contents | 2010
|Equilibrium Results for Dynamic Congestion Games
Online Contents | 2010
|Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing
Online Contents | 1994
|