softcaps_arxiv.bbl
\begin{thebibliography}{10}

\bibitem{Anshelevich03}
E.~Anshelevich, A.~Dasgupta, E.~Tardos, and T.~Wexler.
\newblock Near-optimal network design with selfish agents.
\newblock In {\em Proceedings of the 35th Annual ACM Symposium on the Theory of
  Computing}, pages 511--520, 2003.

\bibitem{Athuraliya01}
S.~Athuraliya, S.~H. Low, V.~H. Li, and Q.~Yin.
\newblock {REM}: Active queue management.
\newblock {\em IEEE Network}, 15(3):48--53, 2001.

\bibitem{Bertsekas03}
D.~P. Bertsekas, A.~Nedic, and A.~E. Ozdaglar.
\newblock {\em Convex Analysis and Optimization}.
\newblock Athena Scientific, Cambridge, Massachusetts, 2003.

\bibitem{Bertsimas97}
D.~Bertsimas and J.~N. Tsitsiklis.
\newblock {\em Introduction to Linear Optimization}.
\newblock Athena Scientific, Cambridge, Massachusetts, 1997.

\bibitem{Briscoe03}
B.~Briscoe, V.~Darlagiannis, O.~Heckman, H.~Oliver, V.~Siris, D.~Songhurst, and
  B.~Stiller.
\newblock A market managed multiservice {I}nternet {(M3I)}.
\newblock {\em Computer Communications}, 26(4):404--414, 2003.

\bibitem{Correa04}
J.~R. Correa, A.~S. Schulz, and N.~{Stier Moses}.
\newblock Selfish routing in capacitated networks.
\newblock {\em Mathematics of Operations Research}, 2004.
\newblock To appear.

\bibitem{Czumaj02}
A.~Czumaj and B.~Voecking.
\newblock Tight bounds for worst-case equilibria.
\newblock In {\em Proceedings of the 13th Annual {ACM-SIAM} Symposium on
  Discrete Algorithms}, pages 413--420, 2002.

\bibitem{Fabrikant03}
A.~Fabrikant, A.~Luthra, E.~Maneva, C.~Papadimitriou, and S.~Shenker.
\newblock On a network creation game.
\newblock In {\em Proceedings of the 22nd Annual {ACM} Symposium on Principles
  of Distributed Computing}, pages 347--351, 2003.

\bibitem{Falkner03}
M.~Falkner, M.~Devetsikiotis, and I.~Lambadaris.
\newblock An overview of pricing concepts for broadband {IP} networks.
\newblock {\em IEEE Communications Surveys}, 3(2), 2000.

\bibitem{Gibbens99}
R.~J. Gibbens and F.~P. Kelly.
\newblock Resource pricing and the evolution of congestion control.
\newblock {\em Automatica}, 35:1969--1985, 1999.

\bibitem{Johari01}
R.~Johari and D.~K. Tan.
\newblock End-to-end congestion control for the {I}nternet: delays and
  stability.
\newblock {\em IEEE/ACM Transactions on Networking}, 9(6):818--832, 2001.

\bibitem{Johari04}
R.~Johari and J.~N. Tsitsiklis.
\newblock Efficiency loss in a network resource allocation game.
\newblock {\em Mathematics of Operations Research}, 29(3):407--435, 2004.

\bibitem{Kelly03}
F.~Kelly.
\newblock Stability and fairness of end-to-end congestion control.
\newblock {\em European Journal of Control}, 9:159--176, 2003.

\bibitem{Kelly97}
F.~P. Kelly.
\newblock Charging and rate control for elastic traffic.
\newblock {\em European Transactions on Telecommunications}, 8:33--37, 1997.

\bibitem{Kelly00}
F.~P. Kelly.
\newblock Models for a self managed {I}nternet.
\newblock {\em Philosophical Transactions: Mathematical, Physical, and
  Engineering Sciences}, 358(1773):2335--2348, 2000.

\bibitem{Kelly98}
F.~P. Kelly, A.~K. Maulloo, and D.~K. Tan.
\newblock Rate control for communication networks: shadow prices, proportional
  fairness, and stability.
\newblock {\em Journal of the Operational Research Society}, 49:237--252, 1998.

\bibitem{Koutsoupias99}
E.~Koutsoupias and C.~Papadimitriou.
\newblock Worst-case equilibria.
\newblock In {\em Proceedings of the 16th Annual Symposium on Theoretical
  Aspects of Computer Science}, pages 404--413, 1999.

\bibitem{Kunniyur01}
S.~Kunniyur and R.~Srikant.
\newblock Analysis and design of an adaptive virtual queue ({AVQ}) algorithm
  for active queue management.
\newblock In {\em Proceedings of ACM SIGCOMM}, pages 123--134, 2001.

\bibitem{Kunniyur03}
S.~Kunniyur and R.~Srikant.
\newblock End-to-end congestion controls schemes: utility functions, random
  losses, and {ECN} marks.
\newblock {\em IEEE/ACM Transactions on Networking}, 11(5):689--702, 2003.

\bibitem{MasColell95}
A.~Mas-Colell, M.~D. Whinston, and J.~R. Green.
\newblock {\em Microeconomic Theory}.
\newblock Oxford University Press, Oxford, United Kingdom, 1995.

\bibitem{Mavronicolas01}
M.~Mavronicolas and P.~Spirakis.
\newblock The price of selfish routing.
\newblock In {\em Proceedings of the 33rd Annual ACM Symposium on the Theory of
  Computing}, pages 510--519, 2001.

\bibitem{Ramakrishnan01}
K.~Ramakrishnan, S.~Floyd, and D.~Black.
\newblock The addition of explicit congestion notification ({ECN}) to {IP}.
\newblock Request for Comments 3168, Internet Engineering Task Force, 2001.

\bibitem{Rockafellar70}
R.~T. Rockafellar.
\newblock {\em Convex Analysis}.
\newblock Priceton Landmarks in Mathematics and Physics. Princeton University
  Press, Princeton, New Jersey, 1970.

\bibitem{Rosen65}
J.~Rosen.
\newblock Existence and uniqueness of equilibrium points for concave $n$-person
  games.
\newblock {\em Econometrica}, 33(3):520--534, 1965.

\bibitem{Roughgarden02}
T.~Roughgarden and E.~Tardos.
\newblock How bad is selfish routing?
\newblock {\em Journal of the ACM}, 49(2):236--259, 2002.

\bibitem{Shenker95}
S.~Shenker.
\newblock Fundamental design issues for the future {I}nternet.
\newblock {\em IEEE Journal on Selected Areas in Communications},
  13:1176--1188, 1995.

\bibitem{Srikant04}
R.~Srikant.
\newblock {\em The Mathematics of {I}nternet Congestion Control}.
\newblock Birkhauser, Boston, Massachusetts, 2004.

\bibitem{Vinnicombe02}
G.~Vinnicombe.
\newblock On the stability of networks operating {TCP}-like congestion control.
\newblock In {\em Proceedings of IFAC World Congress}, 2002.

\end{thebibliography}
