Sensitivity of Wardrop Equilibria
暂无分享,去创建一个
[1] Tim Roughgarden,et al. On the severity of Braess's Paradox: Designing networks for selfish users is hard , 2006, J. Comput. Syst. Sci..
[2] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3] M. A. Hall,et al. Properties of the Equilibrium State in Transportation Networks , 1978 .
[4] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[5] T. Koopmans,et al. Studies in the Economics of Transportation. , 1956 .
[6] Anna Nagurney,et al. Sensitivity analysis for the asymmetric network equilibrium problem , 1984, Math. Program..
[7] Michael Patriksson,et al. Sensitivity Analysis of Traffic Equilibria , 2004, Transp. Sci..
[8] M. Patriksson,et al. Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design , 2007 .
[9] Tim Roughgarden,et al. How unfair is optimal routing? , 2002, SODA '02.
[10] Dietrich Braess,et al. Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.
[11] J G Wardrop,et al. CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .
[12] A. C. Pigou. Economics of welfare , 1920 .
[13] C. Fisk. More paradoxes in the equilibrium assignment problem , 1979 .
[14] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[15] Stella C. Dafermos,et al. Traffic assignment problem for a general network , 1969 .
[16] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .
[17] Tim Roughgarden. The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..