DeepAI AI Chat
Log In Sign Up

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

by   Paulin Jacquot, et al.
Ecole Polytechnique

We consider an instance of a nonatomic routing game. We assume that the network is parallel, that is, constituted of only two nodes, an origin and a destination. We consider infinitesimal players that have a symmetric network cost, but are heterogeneous through their set of feasible strategies and their individual utilities. We show that if an atomic routing game instance is correctly defined to approximate the nonatomic instance, then an atomic Nash Equilibrium will approximate the nonatomic Wardrop Equilibrium. We give explicit bounds on the distance between the equilibria according to the parameters of the atomic instance. This approximation gives a method to compute the Wardrop equilibrium at an arbitrary precision.


page 1

page 2

page 3

page 4


Cost Design in Atomic Routing Games

An atomic routing game is a multiplayer game on a directed graph. Each p...

Efficient Estimation of Equilibria of Large Congestion Games with Heterogeneous Players

Computing an equilibrium in congestion games can be challenging when the...

Atomic Splittable Flow Over Time Games

In an atomic splittable flow over time game, finitely many players route...

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

We study the following repeated non-atomic routing game. In every round,...

Green Routing Game: Strategic Logistical Planning using Mixed Fleets of ICEVs and EVs

This paper introduces a "green" routing game between multiple logistic o...

Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness

We introduce the Colonel Blotto game with favoritism, an extension of th...

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

We consider a routing game among non-atomic agents where link latency fu...