Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#358752] of Andrea Agazzi

Papers Published

  1. Salazar, M; Paccagnan, D; Agazzi, A; Heemels, WPMH, Urgency-aware optimal routing in repeated games through artificial currencies, European Journal of Control (January, 2021) [doi]
    (last updated on 2021/10/17)

    When people choose routes minimizing their individual delay, the aggregate congestion can be much higher compared to that experienced by a centrally-imposed routing. Yet centralized routing is incompatible with the presence of self-interested users. How can we reconcile the two? In this paper we address this question within a repeated game framework and propose a fair incentive mechanism based on artificial currencies that routes selfish users in a system-optimal fashion, while accounting for their temporal preferences. We instantiate the framework in a parallel-network whereby users commute repeatedly (e.g., daily) from a common start node to the end node. Thereafter, we focus on the specific two-arcs case whereby, based on an artificial currency, the users are charged when traveling on the first, fast arc, whilst they are rewarded when traveling on the second, slower arc. We assume the users to be rational and model their choices through a game where each user aims at minimizing a combination of today's discomfort, weighted by their urgency, and the average discomfort encountered for the rest of the period (e.g., a week). We show that, if prices of artificial currencies are judiciously chosen, the routing pattern converges to a system-optimal solution, while accommodating the users’ urgency. We complement our study through numerical simulations. Our results show that it is possible to achieve a system-optimal solution whilst significantly reducing the users’ perceived discomfort when compared to a centralized optimal but urgency-unaware policy.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320