Abstract
In this paper, we tackle the problem of a sequential routing game where multiple users coexist and competitively send their traffic to a destination over a line. The users arrive at time epoch with a given capacity. Then, they ship their demands over time on a shared resource. The state of players evolve according to whether they decide to transmit or not. The decision of each user is thus spatio-temporal control. We provide an explicit expression of the equilibrium of such systems and compare it to the global optimum case. In particular, we determine the expression of price of anarchy of such scheme and identify a Braess-type paradox in the context of sequential routing game.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wardrop, J.G.: Some theoretical aspects of road traffic research communication networks. Proc. Inst. Civ. Eng. Part 2 1, 325–378 (1952)
Patriksson, M.: The Traffic Assignment Problem: Models and Methods. VSP, Utrecht (1994)
Orda, A., Rom, R., Shimkin, N.: Competitive routing in multi-user environments. IEEE/ACM Trans. Netw. 1, 510–521 (1993)
Haurie, A., Marcotte, P.: On the relationship between Nash-Cournot and Wardrop equilibria. Networks 15, 295–308 (1985)
Park, K., Sitharam, M., Chen, S.: Quality of service provision in noncooperative networks with diverse user requirements. Decis. Support Syst. 28(1–2), 101–122 (2000)
Rosenthal, R.W.: A class of games possessing pure strategy Nash equilibria. Int. J. Game Theory 2, 65–67 (1973)
Haddad, M., Altman, E., Gaillard, J.: Sequential routing game on the line: transmit or relay? In: Proceeding of Communications and Information Technology (ICCIT), June 2012
Hanawal, M.K., Altman, E., El-Azouzi, R., Prabhu, B.J.: Spatio-temporal control for dynamic routing games. In: Proceedings of Game Theory for Networks (GameNets), Shanghai, China, April 2011
Altman, E., Basar, T., Jimenez, T., Shimkin, N.: Competitive routing in networks with polynomial cost. IEEE Trans. Autom. Control 47, 92–96 (2002)
Altman, E., Kuri, J., El-Azouzi, R.: A routing game in networks with lossy links. In: 7th International Conference on NETwork Games COntrol and OPtimization (NETGCOOP), Trento, Italy, October 2014
Kameda, H., Pourtallier, O.: Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers. J. ACM 49(3), 407–433 (2002)
Wie, B.W., Friesz, T., Tobin, R.: Dynamic user optimal traffic assignment on congested multidestination networks. Transp. Res. 24B(6), 431–442 (1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Karouit, A., Haddad, M., Altman, E., Lmater, M.A. (2017). Routing Game on the Line: The Case of Multi-players. In: Sabir, E., García Armada, A., Ghogho, M., Debbah, M. (eds) Ubiquitous Networking. UNet 2017. Lecture Notes in Computer Science(), vol 10542. Springer, Cham. https://doi.org/10.1007/978-3-319-68179-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-68179-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68178-8
Online ISBN: 978-3-319-68179-5
eBook Packages: Computer ScienceComputer Science (R0)