Queueing game models for differentiated services
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
A game theoretic framework for joint routing and pricing in networks with elastic demands
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Investment and Market Structure in Industries with Congestion
Operations Research
Technological investment games among wireless telecommunications service providers
International Journal of Network Management
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
Operations Research
| Hi-index | 0.00 |
In this paper, we present a combined study of price competition and traffic control in a congested network. We study a model in which service providers own the routes in a network and set prices to maximize their profits, while users choose the amount of flow to send and the routing of the flow according to Wardrop's principle. When utility functions of users are concave and have concave first derivatives, we characterize a tight bound of 2-3 on efficiency in pure strategy equilibria of the price competition game. We obtain the same bound under the assumption that there is no fixed latency cost, i.e., the latency of a link at zero flow is equal to zero. These bounds are tight even when the numbers of routes and service providers are arbitrarily large. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008