Bottleneck Routing with Elastic Demands
Bottleneck routing games are a well-studied model to investigate the impact of selfish behavior in communication networks. In this model, each user selects a path in a network for routing their fixed demand. The disutility of a used only depends on the most congested link visited. We extend this model by allowing users to continuously vary the demand rate at which data is sent along the chosen path. As our main result we establish tight conditions for the existence of pure strategy Nash equilibria.
Some of the proof techniques used in this paper appeared in the diploma thesis of the third author. We wish to thank three anonymous referees who found several (nontrivial) typos and suggested several improvements and new related references.
- 2.Busch, C., Kannan, R., Samman, A.: Bottleneck routing games on grids. In: Proceedings 2nd International ICST Conference on Game Theory for Networks, pp. 294–307 (2011)Google Scholar
- 5.Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck links, variable demand, and the tragedy of the commons. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 668–677 (2006)Google Scholar
- 8.Gai, Y., Liu, H., Krishnamachari, B.: A packet dropping mechanism for efficient operation of \(M/M/1\) queues with selfish users. In: Proceedings of the 30th IEEE International Conference on Computer Communications, pp. 2687–2695 (2011)Google Scholar
- 11.Harks, T., Hoefer, M., Schewior, K., Skopalik, A.: Routing games with progressive filling. In: Proceedings of the 33rd IEEE International Conference on Computer Communications, pp. 352–360 (2014)Google Scholar
- 12.Harks, T., Klimm, M.: Congestion games with variable demands. In: Apt, K. (ed.) Proceedings of the 13th Conference Theoretical Aspects of Rationality and Knowledge, pp. 111–120 (2011)Google Scholar
- 13.Harks, T., Klimm, M.: Equilibria in a class of aggregative location games. J. Math. Econom. (2015) forthcomingGoogle Scholar
- 19.Keshav, S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. Addison-Wesley, Boston (1997) Google Scholar
- 23.Kukushkin, N.: Acyclicity of improvements in games with common intermediate objectives. Russian Academy of Sciences, Dorodnicyn Computing Center, Moscow (2004)Google Scholar
- 25.Miller, K., Harks, T.: Utility max-min fair congestion control with time-varying delays. In: Proceedings of the 27th IEEE International Conference on Computer Communicatins, pp. 331–335 (2008)Google Scholar
- 29.Sheffi, Y.: Urban Transp. Netw. Prentice-Hall, Upper Saddle River (1985) Google Scholar
- 33.Wardrop, J.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers (Part II), vol. 1, pp. 325–378 (1952)Google Scholar
Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.