A network pricing game for selfish traffic

The success of the Internet is remarkable in light of the decentralized manner in which it is designed and operated. Unlike small scale networks, the Internet is built and controlled by a large number of disperate service providers who are not interested in any global optimization. Instead, providers simply seek to maximize their own profit by charging users for access to their service. Users themselves also behave selfishly, optimizing over price and quality of service. Game theory provides a natural framework for the study of such a situation. However, recent work in this area tends to focus on either the service providers or the network users, but not both. This paper introduces a new model for exploring the interaction of these two elements, in which network managers compete for users via prices and the quality of service provided. We study the extent to which competition between service providers hurts the overall social utility of the system.

[1]  A. C. Pigou.  Economics of welfare , 1920 .

[2]  C. B. Mcguire,et al.  Studies in the Economics of Transportation , 1958 .

[3]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[4]  Robin Mason,et al.  Market structure in congestible markets , 2001 .

[5]  Berthold Vöcking,et al.  Selfish traffic allocation for server farms , 2002, STOC '02.

[6]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[7]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[8]  Daron Acemoglu,et al.  Flow Control, Routing, and Performance from Service Provider Viewpoint 1 , 2003 .

[9]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[10]  Richard Cole,et al.  How much can taxes help selfish routing? , 2003, EC '03.

[11]  Richard Cole,et al.  Pricing network edges for heterogeneous selfish users , 2003, STOC '03.

[12]  Éva Tardos,et al.  Near-optimal network design with selfish agents , 2003, STOC '03.

[13]  Tim Roughgarden.  The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..

[14]  José R. Correa,et al.  Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .

[15]  Mohammad Mahdian,et al.  Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Csaba D. Tóth,et al.  Selfish load balancing and atomic congestion games , 2004, SPAA '04.

[17]  Philipp Afèche.  Incentive-Compatible Revenue Management in Queueing Systems : Optimal Strategic Idleness and other Delaying Tactics , 2004 .

[18]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[19]  Tim Roughgarden.  Stackelberg Scheduling Strategies , 2004, SIAM J. Comput..

[20]  George Karakostas,et al.  Edge pricing of multicommodity networks for heterogeneous selfish users , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[21]  Daron Acemoglu,et al.  Competition and Efficiency in Congested Markets , 2005 .

[22]  Csaba D. Tóth,et al.  Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.

[23]  Awi Federgruen,et al.  Competition in Service Industries , 2005, Oper. Res..

[24]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.