Price competition with elastic traffic

Networks

Volumn 52, Issue 3, 2008, Pages 141-155

  Ozdaglar, Asuman ^a  

^a USA   (United States)

Author keywords

Competition; Efficiency; Elastic traffic; Price of anarchy; Pricing; Social optimum; Wardrop equilibrium

Indexed keywords

ELASTIC TRAFFIC; PRICE OF ANARCHY; PRICING; SOCIAL OPTIMUM; WARDROP EQUILIBRIUM;

COMPETITION; COSTS; GAME THEORY;

COMPUTER NETWORKS;

EID: 55349113244     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20239     Document Type: Article

References (22)

1. D. Acemoglu and A. Ozdaglar, Competition in parallelserial networks, IEEE J Select Areas Commun 25 (2007), 1180-1192.
2. D. Acemoglu and A. Ozdaglar, Competition and efficiency in congested markets, Math Operat Res 32 (2007), 1-31.
3. D. Acemoglu and A. Ozdaglar, Flow control, routing, and performance from service provider viewpoint, LIDS report WP 1696, MIT, Cambridge, MA, 2004.
4. T. Basar and R. Srikant, Revenue-maximizing pricing and capacity expansion in a many-users regime, Proc IEEE INFOCOM, New York, NY, 2002, pp. 294-301.
5. M. Beckmann, C.B. Mcguire, and C.B. Winsten, Studies in the economics of transportation, Yale University Press. New Haven, CT, 1956.
6. C. Berge, Topological Spaces, Dover Publications, New York. 1997.
7. J.R. Correa, A.S. Schulz, and N. Stier Moses, Selfish routing in capacitated networks. Math Operat Res 29 (2004), 961-976.
8. S. Dafermos and R T. Sparrow, The traffic assignment problem for a general network, J Res Nat Bureau of Standards-B. Math Sci 73 (1969), 91-118.
9. E. Friedman, A generic analysis of selfish routing, Proc 43rd IEEE Conf on Decision and Control. Ithaca, NY, 2004, pp. 4667-4672.
10. A. Hayrapetyan. E. Tardos, and T. Wexler, A network pricing game for selfish traffic, Distribut Comput 19 (2007), 255-266.
11. L. He and J. Walrand, Pricing internet services with multiple providers, Proc 41st Allerton Conf, Monticello, IL, 2003.
12. P.P. Kelly. A.K. Maulloo. and D.K. Tan. Rate control for communication networks: shadow prices, proportional fairness, and stability, J Operat Res Soc 49 (1998), 237-252.
13. E. Koutsoupias and C. Papadimitriou, Worst-case equilibria, Proc 16th STACS, Trier, Germany, 1999. pp. 404-413.
14. S. Low and D.E. Lapsley, Optimization flow control. I. Basic algorithm and convergence, IEEE/ACM Trans Network 7 (1999), 861-874.
15. I. Milchtaich, Congestion games with player-specific payoff functions, Games Economic Behav 13 (1996), 11-124.
16. M. Patriksson, The traffic assignment problem: models and methods, VSP BV, Netherlands, 1994.
17. G. Perakis, The price of anarchy when costs are non-separable and asymmetric, Proc 10th Conf IPCO. New York, NY, 2004, pp. 46-58.
18. R.W. Rosenthal, A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2 (1973), 65-67.
19. T. Roughgarden and E. Tardos, How bad is selfish routing?. J ACM 49 (2002), 236-259.
20. S. Shenker, Fundamental design issues for the future Internet. IEEE J Select Areas Commun 13 (1995), 1176-1188.
21. J.G. Wardrop, Some theoretical aspects of road traffic research, Proc Inst Civil Eng Pt. II, 1 (1952), 325-378.
22. H. Yaïche. R.R. Mazumdar, and C. Rosenberg. A game theoretic framework for bandwidth allocation and pricing in broadband networks, IEEE/ACM Trans Network 9 (2000), 667-678.