[1] Roughgarden T. Stackelberg scheduling strategies[C]. Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, 2001: 104-113.
[2] 刘天亮, 欧阳恋群, 黄海军. ATIS作用下的混合交通行为网络与效率损失上界[J]. 系统工程理论与实践,2007, 27(4): 154–159.[LIU T L, OUYANG L Q, HUANG H J. Mixed travel behavior in networks with ATIS and upper bound of efficiency loss [J]. Systems Engineering Theory & Practice, 2007, 27(4): 154-159.]
[3] Yu X J, Huang H J. Efficiency loss of mixed equilibrium behaviors with polynomial cost functions[J]. Promet Traffic & Transportation, 2010, 22(5): 325-331.
[4] Chen P A, Kempe D. Altruism, selfishness, and spite in traffic routing[C]. Proceedings of the 9th ACM Conference on Electronic Commerce. Chicago, Illinois, USA, 2008: 140–149.
[5] Karakostas G, Kim T, Viglas A, et al. On the degradation of performance for traffic networks with oblivious players[J]. Transportation Research Part B, 2011, 45(2): 364-371.
[6] Ledyard J. Public goods: A survey of experimental research[C]//Kagel J.,Roth A.(Eds.) Handbook of Experimental Economics. Princeton University Press, 1997: 111-194.
[7] Kinderlehrer D, Stampacchia G. An introduction to variational inequalities and their applications[M]. Academic Press, New York, 1986.
[8] Karakostas G, Kolliopoulos S G. The efficiency of optimal taxes[C]. Proceedings of the First Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), 2004: 3-12. |