Linearly-Solvable Mean-Field Approximation for Multi-Team Road Traffic Games

arXiv1910.01087MaRDI QIDQ6326427FDOQ6326427

Publication date: 2 October 2019

Abstract: We study the traffic routing game among a large number of selfish drivers over a traffic network. We consider a specific scenario where the strategic drivers can be classified into teams, where drivers in the same team have identical payoff functions. An incentive mechanism is considered to mitigate congestion, where each driver is subject to dynamic tax penalties. We explore a special case in which the tax is affine in the logarithm of the number of drivers selecting the same route from each team. It is shown via a mean-field approximation that a Nash equilibrium in the limit of a large population can be found by linearly solvable algorithms.

This page was built for publication: Linearly-Solvable Mean-Field Approximation for Multi-Team Road Traffic Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326427)