Toll Caps in Privatized Road Networks

02/28/2018
by   Tobias Harks, et al.
0

We study a nonatomic routing game on a parallel link network in which link owners set tolls for travel so as to maximize profit. A central authority is able to regulate this competition by means of a (uniform) price cap. The first question we want to answer is how such a cap should be designed in order to minimize the total congestion. We provide an algorithm that finds an optimal price cap for networks with affine latency functions. Second, we consider the performance of an optimal price cap. We show that for duopolies, the congestion costs at the optimal price cap are at most twice the congestion costs of the optimal flow, under the condition that an uncapped subgame perfect Nash equilibrium exists. However, in general such an equilibrium need not exist and this fact can be used to show that optimal price caps can induce arbitrarily inefficient flows.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset