Convergence in a Repeated Non-atomic Routing Game with Partial Signaling

07/23/2022
by   Yixian Zhu, et al.
0

We study the following repeated non-atomic routing game. In every round, nature chooses a state in an i.i.d. manner according to a publicly known distribution, which influences link latency functions. The system planner makes private route recommendations to participating agents, which constitute a fixed fraction, according to a publicly known signaling strategy. The participating agents choose between obeying or not obeying the recommendation according to cumulative regret of the participating agent population in the previous round. The non-participating agents choose route according to myopic best response to a calibrated forecast of the routing decisions of the participating agents. We show that, for parallel networks, if the planner's signal strategy satisfies the obedience condition, then, almost surely, the link flows are asymptotically consistent with the Bayes correlated equilibrium induced by the signaling strategy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2020

A Semidefinite Approach to Information Design in Non-atomic Routing Games

We consider a routing game among non-atomic agents where link latency fu...
research
07/31/2022

An Experimental Study on Learning Correlated Equilibrium in Routing Games

We study route choice in a repeated routing game where an uncertain stat...
research
04/09/2018

Routing Game on Parallel Networks: the Convergence of Atomic to Nonatomic

We consider an instance of a nonatomic routing game. We assume that the ...
research
10/03/2022

Cost Design in Atomic Routing Games

An atomic routing game is a multiplayer game on a directed graph. Each p...
research
04/22/2022

Stackelberg Routing of Autonomous Cars in Mixed-Autonomy Traffic Networks

As autonomous cars are becoming tangible technologies, road networks wil...
research
10/17/2021

Dynamic Tolling for Inducing Socially Optimal Traffic Loads

How to design tolls that induce socially optimal traffic loads with dyna...
research
08/03/2018

The Complexity of Sequential Routing Games

We study routing games where every agent sequentially decides her next e...

Please sign up or login with your details

Forgot password? Click here to reset