Urgency-aware Routing in Single Origin-destination Itineraries through Artificial Currencies

03/29/2023
by   Leonardo Pedroso, et al.
0

Within mobility systems, the presence of self-interested users can lead to aggregate routing patterns that are far from the societal optimum which could be achieved by centrally controlling the users' choices. In this paper, we design a fair incentive mechanism to steer the selfish behavior of the users to align with the societally optimal aggregate routing. The proposed mechanism is based on an artificial currency that cannot be traded or bought, but only spent or received when traveling. Specifically, we consider a parallel-arc network with a single origin and destination node within a repeated game setting whereby each user chooses from one of the available arcs to reach their destination on a daily basis. In this framework, taking faster routes comes at a cost, whereas taking slower routes is incentivized by a reward. The users are thus playing against their future selves when choosing their present actions. To capture this complex behavior, we assume the users to be rational and to minimize an urgency-weighted combination of their immediate and future discomfort. To design the optimal pricing, we first derive a closed-form expression for the best individual response strategy. Second, we formulate the pricing design problem for each arc to achieve the societally optimal aggregate flows, and reformulate it so that it can be solved with gradient-free optimization methods. Our numerical simulations show that it is possible to achieve a near-optimal routing whilst significantly reducing the users' perceived discomfort when compared to a centralized optimal but urgency-unaware policy.

READ FULL TEXT

page 1

page 4

page 7

research
11/27/2022

A Data-driven Pricing Scheme for Optimal Routing through Artificial Currencies

Mobility systems often suffer from a high price of anarchy due to the un...
research
03/31/2021

Balancing Fairness and Efficiency in Traffic Routing via Interpolated Traffic Assignment

System optimum (SO) routing, wherein the total travel time of all users ...
research
12/05/2017

Robust toll pricing: A novel approach

We study a robust toll pricing problem where toll setters and users have...
research
04/15/2019

How to Price Fresh Data

We introduce the concept of a fresh data market, in which a destination ...
research
07/23/2019

Utilizing Information Optimally to Influence Distributed Network Routing

How can a system designer exploit system-level knowledge to derive incen...
research
08/25/2023

To Rectify Routing Games for Social Information Sharing

We study a new incentive problem of social information sharing for locat...
research
02/18/2021

The Effectiveness of Subsidies and Tolls in Congestion Games

Are rewards or penalties more effective in influencing user behavior? Th...

Please sign up or login with your details

Forgot password? Click here to reset