mlsanityData to 14 Oct 2026

Pricing Traffic Networks with Mixed Vehicle Autonomy

arXiv 1904.01226 ↗First posted 2 Apr 2019cs.GT cs.SY eess.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

In a traffic network, vehicles normally select their routes selfishly. Consequently, traffic networks normally operate at an equilibrium characterized by Wardrop conditions. However, it is well known that equilibria are inefficient in general. In addition to the intrinsic inefficiency of equilibria, the authors recently showed that, in mixed-autonomy networks in which autonomous vehicles maintain a shorter headway than human-driven cars, increasing the fraction of autonomous vehicles in the network may increase the inefficiency of equilibria. In this work, we study the possibility of obviating the inefficiency of equilibria in mixed-autonomy traffic networks via pricing mechanisms. In particular, we study assigning prices to network links such that the overall or social delay of the resulting equilibria is minimum. First, we study the possibility of inducing such optimal equilibria by imposing a set of undifferentiated prices, i.e. a set of prices that treat both human-driven and autonomous vehicles similarly at each link. We provide an example which demonstrates that undifferentiated pricing is not sufficient for achieving minimum social delay. Then, we study differentiated pricing where the price of traversing each link may depend on whether vehicles are human-driven or autonomous. Under differentiated pricing, we prove that link prices obtained from the marginal cost taxation of links will induce equilibria with minimum social delay if the degree of road capacity asymmetry (i.e. the ratio between the road capacity when all vehicles are human-driven and the road capacity when all vehicles are autonomous) is homogeneous among network links.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 2 Apr 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.