The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands

作者: Chi Kin Chau , Kwang Mong Sim

DOI: 10.1016/S0167-6377(03)00030-0

关键词:

摘要: By showing that there is an upper bound for the price of [email protected](@C) a non-atomic congestion game @C with only separable cost maps and fixed demands, Roughgarden Tardos show forgoing centralized control mild. This letter shows @r(@C) in demands symmetric maps. It also weaker elastic demands.

参考文章(12)
Elias Koutsoupias, Christos Papadimitriou, Worst-case equilibria symposium on theoretical aspects of computer science. pp. 404- 413 ,(1999) , 10.1007/3-540-49116-3_38
Pia Bergendorff, Donald W. Hearn, Motakuri V. Ramana, Congestion Toll Pricing of Traffic Networks Lecture Notes in Economics and Mathematical Systems. pp. 51- 71 ,(1997) , 10.1007/978-3-642-59179-2_4
Arthur Cecil Pigou, The Economics of Welfare ,(1920)
D. Braess, Über ein Paradoxon aus der Verkehrsplanung Unternehmensforschung Operations Research - Recherche Opérationnelle. ,vol. 12, pp. 258- 268 ,(1968) , 10.1007/BF01918335
Hai Yang, Hai-Jun Huang, Principle of marginal-cost pricing : How does it work in a general road network ? Transportation Research Part A-policy and Practice. ,vol. 32, pp. 45- 54 ,(1998) , 10.1016/S0965-8564(97)00018-9
Tim Roughgarden, The price of anarchy is independent of the network topology symposium on the theory of computing. ,vol. 67, pp. 428- 437 ,(2002) , 10.1145/509907.509971
Igal Milchtaich, CONGESTION MODELS OF COMPETITION The American Naturalist. ,vol. 147, pp. 760- 783 ,(1996) , 10.1086/285878
Tim Roughgarden, Éva Tardos, How bad is selfish routing? Journal of the ACM. ,vol. 49, pp. 236- 259 ,(2002) , 10.1145/506147.506153
Igal Milchtaich, Generic Uniqueness of Equilibrium in Large Crowding Games Mathematics of Operations Research. ,vol. 25, pp. 349- 364 ,(2000) , 10.1287/MOOR.25.3.349.12220