Extended abstract: Price of anarchy of traffic assignment with exponential cost functions

This paper is an extended abstract version of "Price of Anarchy of Traffic Assignment with Exponential Cost Functions [5]". We study a routing game where vehicles, selfish agents, independently choose routes to minimize travel delays from road congestion. We focus on exponential latency functions, unlike prior research using polynomial functions like BPR. We calculate a tight upper bound for the price of anarchy and compare it with the BPR function. Results indicate that the exponential function has a lower upper bound for traffic volumes below road capacity than the BPR function. Numerical analysis using real-world data shows that the exponential function closely approximates road latency with even tighter parameters, resulting in a relatively lower upper bound.