2026-04-18T04:39:56Zhttps://recercat.cat/oai/requestoai:recercat.cat:2117/863072025-07-17T12:24:53Zcom_2072_1033col_2072_452950
RECERCAT
author
Álvarez Faura, M. del Carme
author
Francès, Guillem
2007-09
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)
Open Access
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Network congestion games
Nash equilibria
Computational complexity
Edge-disjoint paths
Maximum congestion games on networks: How can we compute their equilibria?
External research report