[1] Koutoupias E, Papaimitriou C. Worst-case Equilibria[C]// Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science. Trier, Germany: [s. n.], 1999: 404-413.
[2] Roughgarden T, Tardos E. How Bad Is Selfish Routing?[J]. Journal of the ACM, 2002, 49(2): 236-259.
[3] Yang Hai, Huang Haijun. Mathematical and Economic Theory of Road Pricing[M]. Oxford, UK: Elsevier, 2005.
[4] Roughgarden T, Tardos E. The Price of Anarchy Is Independent of the Network Topology[J]. Journal of Computer and System Science, 2003, 67(2): 341-364.
[5] Ferrante A, Parente M. Mixed Nash Equilibria in Selfish Routing Problems with Dynamic Constraints[J]. Theoretical Computer Science, 2008, 393(1-3): 37-53.
[6] 杨春勇, 陈少平. 基于改进蚁群算法的网络负载均衡路由优 化[J]. 计算机工程, 2010, 36(8): 4-6.
[7] 隆 婷, 陈志刚, 赵 明, 等. 机会路由中激励合作机制的博弈分析[J]. 计算机工程, 2010, 36(12): 126-128.
[8] Ledyard J. Public Goods: A Survey of Experimental Research[M]// Kagel J, Roth A. Handbook of Experimental Economics. New Jersey, USA: Princeton University Press, 1997: 111-194.
[9] Levine D K. Modeling Altruism and Spitefulness in Experiments[J]. Review of Economic Dynamics, 1998, l(3): 593- 622.
[10] Chen Po-an, Kempe D. Altruism, Selfishness, and Spite in Traffic Routing[C]//Proceedings of the 9th ACM Conference on Electronic Commerce. Chicago, Illinois, USA: ACM Press, 2008: 140-149.
[11] Karakostas G, Kim T, Viglas A, et al. Selfish Routing with Oblivious Users[EB/OL]. (2007-09-23). http//www.cas.mcmaster. ca/~gk/papers/oblivi.
[12] 侯海洋. 一类包含刻板用户的Wardrop路由博弈[J]. 应用数学学报, 2008, 31(4): 577-583.
[13] Harker P T. Multiple Equilibrium Behaviors on Networks[J]. Transportation Science, 1988, 22(1): 39-46.
[14] Kinderlehrer D, Stampacchia G. An Introduction to Variational Inequalities and Their Applications[M]. New York, USA: Academic Press, 1986.
[15] Correa J R, Schulz A S, Stier-Moses N S. Selfish Routing in Capacitated Networks[J]. Mathematics of Operations Research, 2004, 29(4): 961-976. |