Competition in parallel-serial networks

IEEE Journal on Selected Areas in Communications

Volumn 25, Issue 6, 2007, Pages 1180-1192

  Acemoglu, Daron ^b   Ozdaglar, Asuman ^a,c  

^a IEEE   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c USA   (United States)

Author keywords

Competition; Congestion externalities; Efficiency; Oligopoly equilibrium; Price of anarchy; Pricing; Social optimum; Wardrop equilibrium

Indexed keywords

CONGESTION EXTERNALITIES; OLIGOPOLY EQUILIBRIUM; PRICE OF ANARCHY; SOCIAL OPTIMUM; WARDROP EQUILIBRIUM;

COMPETITION; CONGESTION CONTROL (COMMUNICATION); COSTS; OPTIMIZATION; TELECOMMUNICATION SERVICES;

TELECOMMUNICATION NETWORKS;

EID: 34547433002     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2007.070812     Document Type: Article

References (26)

1. F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: shadow prices, proportional fairness, and stability," Journal of the Operational Research Society, vol. 49, pp. 237-252, 1998.
2. S. Low and D. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Transactions on Networking, vol. 7, no. 6, pp. 861-874, 1999.
3. H. Yaiche, R. Mazumdar, and C. Rosenberg, "A game theoretic framework for bandwidth allocation and pricing in broadband networks," IEEE/ACM Transactions on Networking, vol. 9, no. 5, 2000.
4. T. Roughgarden and É.. Tardos, "How bad is selfish routing?" Journal of the ACM, vol. 49, no. 2, pp. 236-259, 2002.
5. D. Acemoglu and A. Ozdaglar, "Flow control, routing, and performance from service provider viewpoint," LIDS, Massachusetts Institute of Technology, Cambridge, MA, Tech. Rep. WP-1696, 2004.
6. X. Huang, A. Ozdaglar, and D. Acemoglu, "Efficiency and Braess' paradox under pricing in. general networks," IEEE Journal on Selected Areas in Communication, special issue on Price-Based Access Control and Economics, vol. 24, no. 5, pp. 977-991, 2006.
7. D. Acemoglu and A. Ozdaglar, "Competition and efficiency in congested markets," Mathematics of Operations Research, 2007.
8. J. Harsanyi, "Games with randomly distributed payoffs: a new rationale for mixed strategy equilibrium, points," International Journal of Game Theory, vol. 1, pp. 1-23, 1973.
9. J. Correa, A. Schulz, and N. Stier-Moses, "Selfish routing in capacitated networks," Mathematics of Operations Research, vol. 29, no. 4, pp. 961-976, 2002.
10. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," in Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999, pp. 404-413.
11. E. Friedman, "A generic analysis of selfish routing," in. Proceedings of IEEE CDC, 2004.
12. R. Johari and J. Tsitsiklis, "Network resource allocation and a congestion game," Mathematics of Operations Research, vol. 29, no. 3, pp. 407-435, 2004.
13. S. Sanghavi and B. Hajek, "Optimal allocation of a divisible good to strategic buyers," in Proceedings of IEEE CDC, 2004.
14. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden, "The price of stability for network design with selfish agents," in Proceedings of IEEE Symposium on the Foundations of Computer Science, 2004, pp. 295-304.
15. T. Basar and R. Srikant, "Revenue-maximizing pricing and capacity expansion in a many-users regime," in Proceedings of IEEE INFOCOM, 2002.
16. L. He and J. Walrand, "Pricing Internet services with, multiple providers," in Proceedings of Allerton Conference, 2003.
17. A. Hayrapetyan, E. Tardos, and T. Wexler, "A network pricing game for selfish traffic," in Proceedings of Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2005.
18. A. Ozdaglar, "Price competition with elastic traffic," Networks, 2007.
19. J. Wardrop, "Some theoretical aspects of road traffic research," in Proceedings of the Institute of Civil Engineers, 1952, pp. 325-378.
20. M. Beckmann, C. Mcguire, and C. Winsten, Studies in the Economics of Transportation. Yale University Press, 1956.
21. S. Dafermos and F. Sparrow, "The traffic assignment problem for a general network," Journal of Research of the National Bureau of Standards-B. Mathematical Sciences, vol. 73, no. 2, pp. 91-118, 1969.
22. M. Patriksson, The Traffic Assignment Problem: Models and Methods, Netherlands, 1994.
23. D. Fudenberg and J. Tirole, Game Theory. Cambridge: MIT Press, 1991.
24. B. Bernheim, B. Peleg, and M. Whinston, "Coalition-proof Nash, equilibria I. concepts," Journal of Economic Theory, vol. 42, no. 1, pp. 1-12, 1987.
25. R. Aumann, "Acceptable points in general, cooperative n-person games," in Contributions to the theory of games, IV. Princeton: Princeton University Press, 1959.
26. C. Berge, Topological Spaces. Dover reprint, 1963.