Routing game on the line: The case of multi-players - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Routing game on the line: The case of multi-players

(1) , (1) , (2, 3, 4) , (5)
1
2
3
4
5

Abstract

In this paper, we study a sequential routing game networks where M users send traffic to a destination on a line. Each user arrives at time epoch with a given capacity. Then, he ships its demand over time on a shared resource. The state of a player evolves according to whether he decides to transmit or not. The decision of each user is thus spatio-temporal control. We provide explicit expression of the equilibrium of such systems and compare it to the global optimum case. In particular, we compute the price of anarchy of such scheme and identify a Braess-type paradox in the context of sequential routing game.
Fichier principal
Vignette du fichier
1570341486 (1).pdf (303.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01536349 , version 1 (11-06-2017)

Identifiers

  • HAL Id : hal-01536349 , version 1

Cite

Abdelillah Karouit, Majed Haddad, Eitan Altman, Abdellatif El Matar. Routing game on the line: The case of multi-players. UNet'2017 - Third International Symposium on Ubiquitous Networking, May 2017, Casablanca, Morocco. ⟨hal-01536349⟩
158 View
237 Download

Share

Gmail Facebook Twitter LinkedIn More