The price of anarchy in competing differentiated services networks
暂无分享,去创建一个
[1] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[2] John N. Tsitsiklis,et al. A scalable network resource allocation mechanism with bounded efficiency loss , 2006, IEEE Journal on Selected Areas in Communications.
[3] J. Goodman. Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .
[4] Robin Mason,et al. Internet service classes under competition , 2000, IEEE Journal on Selected Areas in Communications.
[5] Asuman Ozdaglar,et al. Price competition with elastic traffic , 2008 .
[6] Uday S. Karmarkar,et al. Internal Pricing and Cost Allocation in a Model of Multiproduct Competition with Finite Capacity Increments , 1993 .
[7] S. Wu,et al. The Price of Anarchy in a Network Pricing Game , 2007 .
[8] John N. Tsitsiklis,et al. Efficiency loss in a network resource allocation game: the case of elastic supply , 2005, IEEE Trans. Autom. Control..
[9] Esther Gal-Or,et al. Quality and Quantity Competition , 1983 .
[10] Jeffrey K. MacKie-Mason,et al. Pricing Congestible Network Resources (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..
[11] Éva Tardos,et al. A network pricing game for selfish traffic , 2006, Distributed Computing.
[12] Andrew M. Odlyzko,et al. Paris metro pricing for the internet , 1999, EC '99.