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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01536349
Contributor : Eitan Altman <>
Submitted on : Sunday, June 11, 2017 - 6:08:56 AM
Last modification on : Thursday, October 17, 2019 - 12:36:05 PM
Long-term archiving on : Friday, December 15, 2017 - 10:43:57 AM

File

1570341486 (1).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01536349, version 1

Citation

Abdelillah Karouit, Majed Haddad, Eitan Altman, Abdellatif 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⟩

Share

Metrics

Record views

256

Files downloads

226