Improving Social Cost in Traffic Routing with Bounded Regret via Second-Best Tolls
Authors:
- 16 December 2024
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4179-4186
Abstract
In this work, we investigate algorithmic improvements that navigation services can implement to steer road networks toward a system-optimal state while retaining high levels of user compliance. We model the compliance of users using marginal regret, and we extend the definition of the social cost function to account for various traffic congestion externalities. We propose a routing algorithm for the static traffic assignment problem that improves the social cost with guarantees on the worst-case regret in the network. This algorithm leverages the connection we establish between this problem and that of second-best toll pricing. We present numerical experiments on different networks to illustrate the trade-off between regret and efficiency of the resulting assignment for arbitrary social costs.Keywords
This publication has 33 references indexed in Scilit:
- Balancing fairness and efficiency in traffic routing via interpolated traffic assignmentAutonomous Agents and Multi-Agent Systems, 2023
- Minimizing the total travel time with limited unfairness in traffic networksComputers & Operations Research, 2020
- Efficiency of Restricted Tolls in Non-atomic Network Routing GamesLecture Notes in Computer Science, 2011
- Heuristic algorithms for a second-best congestion pricing problemNETNOMICS: Economic Research and Electronic Networking, 2009
- Taxing SubnetworksLecture Notes in Computer Science, 2008
- Decomposition techniques for the minimum toll revenue problemNetworks, 2004
- An MPEC approach to second-best toll pricingMathematical Programming, 2004
- Transportation and Network Analysis: Current Trends2002
- Solving Congestion Toll Pricing Models1998
- Congestion Toll Pricing of Traffic Networks1997