Abstract
This paper considers a selfish routing based network improvement problem, in which the authors would like to find a modified latency function that results in a new Nash equilibrium flow satisfying all traffic demands subject to the target capacity, while the total modification cost on edge latency is minimized. By using the reduction from the 3-Satisfiability (3-SAT) problem to our problem, the authors show that this problem is strongly NP-hard, even for the single commodity network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Beckmann, C. B. Mcguire, and C. B. Winsten, Studies in the Economics of Transportation, Yale University Press, New Haven, CT, 1956.
J. F. Nash, Equilibrium points in n-person games, Proceedings of National Academy of Sciences, 1950, 36: 48–49.
A. Haurieand and P. Marcotte, On the relation between Nash-Cournot and Wardrop equilibria, Networks, 1985, 15: 295–308.
E. Koutsoupias and C. H. Papadimitriou, Worst-case equilibria, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, 1999: 404–413.
J. D. Murchkand, Braess’s paradox of traffic flow, Transport, Res., 1970, 4: 391–394.
T. Roughgarden, Designing networks for selfish users is hard, Proceedings of the 42th Annual Symposium on Foundations of Computer Science, 2001: 472–481.
T. Roughgarden and E. Tardos, How bad is selfish routing? J. ACM., 2002, 49(2): 236–259.
T. Roughgarden, The price of anarchy is independent of the network topology, J. Comput. System Sci., 2003, 67: 341–364.
T. Roughgarden, Stackelberg scheduling strategies, SIAM. J. Comput., 2004, 33(2): 332–350.
R. Cole, Y. Dodis, and T. Roughgarden, How much can taxes help selfish routing? J. Comput. System Sci., 2006, 72(3): 444–467.
G. Oven, Game Theory, 3rd ed, Acadimic Press, New York, 1995.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA, 1979.
B. W. Zhang, J. Z. Zhang, and L. Q. Qi. The shortest path improvement problem under Hamming distance, Journal of Combinatorial Optimization, 2006, 12(4): 351–361.
Author information
Authors and Affiliations
Corresponding author
Additional information
The work is supported Hohai University Funds under Grant Nos. XZX/08B002-02, 2009428211, and the US National Science Foundation under Grant No. DMI-0553310.
This paper was recommended for publication by Editor Shouyang WANG.
Rights and permissions
About this article
Cite this article
Zhang, B., Fang, SC. A selfish routing based network improvement problem. J Syst Sci Complex 24, 68–78 (2011). https://doi.org/10.1007/s11424-011-8156-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-011-8156-7