2 code implementations • 31 Mar 2021 • Devansh Jalota, Kiril Solovey, Matthew Tsao, Stephen Zoepf, Marco Pavone
To address the inherent unfairness of SO routing, we study the ${\beta}$-fair SO problem whose goal is to minimize the total travel time while guaranteeing a ${\beta\geq 1}$ level of unfairness, which specifies the maximum possible ratio between the travel times of different users with shared origins and destinations.