Potential game in parallel transport network with symmetric externalities

Abstract

The paper considers a model of a transport system with parallel channels and BPR delay functions with symmetric linear externalities. We consider the case where the impact of channel loads to the delay is pairwise symmetric. For this case, it is proved that the game of traffic allocation among channels is potential, and the price of anarchy is limited by the value $\frac{4}{3}$.