Genericity and congestion control in selfish routing

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2004, Pages 4667-4672

  Friedman, Eric J ^a  

^a School of Chemical and Molecular Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; CARRIER COMMUNICATION; INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RANDOM PROCESSES; ROUTERS; SPURIOUS SIGNAL NOISE;

GENERICITY; NASH EQUILIBRIUM; ROUGHGARDEN AND TARDOS MODEL; SELFISH ROUTING;

CONGESTION CONTROL (COMMUNICATION);

EID: 14544269534     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2004.1429524     Document Type: Conference Paper

References (26)

1. L. Adamic and B. Huberman. The web's hidden order. Communications of the ACM, 44(9), 2001.
2. A. Archer and É. Tardos. Truthful mechanisms for one-parameter agents. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001.
3. W. B. Arthur. Inductive reasoning and bounded rationality. American Economic Review (Papers and Proceedings), 84(2):406-411, 1994.
4. I. Castineyra, J. N. Chiappa, and M. Steenstrup. The nimrod routing architecture. Working Draft, January 1995.
5. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. In Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, pages 218-227, 2000.
6. S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based congestion control for unicast applications. In Proc. ACM Sigcomm 2000, 2000.
7. E. J. Friedman. Dynamics and rationality in ordered externality games. Games and Economic Behavior, 16:65-76, 1996.
8. E. J. Friedman. Learnability in non-atomic externality games, with applications to computer networks. (www.orie.cornell.edu/~friedman), 1997.
9. E. J. Friedman and S. Shenker. Learning and implementation in the Internet, mimeo, available from (www.orie.cornell.edu/~friedman), 1998.
10. D. Fudenberg and J. Tirole. Game Theory. MIT Press, Cambridge, Massachusetts, 1991.
11. M. W. Hirsch. Differential Topology. Springer-Verlag, New York, 1976.
12. K. Jain and V. Vazirani. Applications of approximation algorithms to cooperative games. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, 2002.
13. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 404-413, 1999.
14. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 510-519, 2001.
15. P. Naor. On the regulation of queue size by levying tolls. Econometrica, 37:15-24, 1969.
16. N. Nisan. Algorithms for selfish agents: Mechanism design for distributed computation. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 1-15, 1999.
17. N. Nisan and A. Ronen. Algorithmic mechanism design. In Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, pages 129-140, 1999.
18. C. Papadimitriou. Algorithms, games, and the internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749-753, 2001.
19. T. Roughgarden. Designing networks for selfish users is hard. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pages 472-481, 2001. Full version available at http://www.cs.cornell.edu/timr.
20. T. Roughgarden and E. Tardos. How bad is selfish routing? In 41st Annual Symposium on the Foundations of Computer Science. IEEE, October 2000.
21. B. Sanders. An incentive compatible flow control algorithm for rate allocation in computer networks. IEEE Transactions on Computers, 37:1067-72, 1988.
22. D. Schmeidler. Equilibrium points of nonatomic games. Journal of Statistical Physics, 7:295-300, 1973.
23. S. Shenker. Efficient network allocations with selfish users. In P. J. B. King, I. Mitrani, and R. J. Pooley, editors, Performance '90, pages 279-285. North-Holland, New York, 1990.
24. J. Smith. Generalized chebychev inequalities: Theory and applications in decision analysis. Operations Research, 43:807-825, 1995.
25. S. Stidham. Pricing and capacity decisions for a service facility: Stability and multiple local optima. Management Science, 38(8): 1121-1139, 1992.
26. N. Young. On-line file caching. In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.