[1] Braess D. Uber ein Paradoxon aus der Verkehrsplanung[J]. Unternehmensforschung, 1968, 12:258-268.
[2] Tim Roughgarden, Eva Tardos. How bad is selfish routing[J]. Journal of the ACM, 2002, 49:236-259.
[3] Chen X J, Diao Z, Hu X D. Network characterizations for excluding Braess's Paradox[J]. Theory of Computing Systems, 2016, 59:747-780.
[4] Chen X J, Diao Z, Hu X D. Excluding Braess's Paradox in nonatomic selfish routing[C]//The 8th International Symposium on Algorithmic Game Theory, 2015, 219-230.
[5] Chen X J, Diao Z, Hu X D. Network topologies for weak Pareto optimality in nonatomic selfish routing[C]//The 22nd International Computing and Combinatorics Conference, 2016, 27-38.
[6] Igal Milchtaich. Network topology and the efficiency of equilibrium[J]. Games and Economic Behavior, 2006, 57:321-346.
[7] Ron Holzman, Nissan Law-yone. Strong equilibrium in congestion games[J]. Games and Economic Behavior, 1997, 21:85-101.
[8] Ron Holzman, Nissan Law-yone. Network structure and strong equilibrium in route selection games[J] Mathematical Social Sciences, 2003, 46:193-205.
[9] Ron Holzman, Nissan Law-yone. Strong equilibrium in network congestion games:increasing versus decreasing costs[J] International Journal of Game Theory, 2014, 44:647-666. |