Routing Game on Parallel Networks: the Convergence of Atomic to Nonatomic - École polytechnique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

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

Résumé

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.
Fichier principal
Vignette du fichier
convergenceNonatomicFullProofs.pdf (463.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01762547 , version 1 (10-04-2018)

Identifiants

  • HAL Id : hal-01762547 , version 1

Citer

Paulin Jacquot, Cheng Wan. Routing Game on Parallel Networks: the Convergence of Atomic to Nonatomic. CDC 2018 - IEEE 57th Conference on Decision and Control, IEEE, Dec 2018, Miami, United States. ⟨hal-01762547⟩
595 Consultations
279 Téléchargements

Partager

Gmail Facebook X LinkedIn More