Skip to main content
Have a personal or library account? Click to login
Competitive Traffic Assignment in Road Networks Cover

Competitive Traffic Assignment in Road Networks

Transport and Telecommunication Journal
Volume 17 (2016): Issue 3 (September 2016)
By: ,   and    
Open Access
|Jun 2016
References

References

  1. 1. Altman, E., Basar, T., Jimenez, T., Shimkin, N. (2002) Competitive routing in networks with polynomial costs. IEEE Transactions on automatic control, 47(1), 92-96.
    Open DOISearch in Google Scholar
  2. 2. Altman, E., Combes, R., Altman, Z., Sorin, S. (2011) Routing games in the many players regime. In: Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, pp. 525-527.
    Search in Google Scholar
  3. 3. Altman, E., Kameda, H. (2005) Equilibria for multiclass routing problems in multi-agent networks. Advances in Dynamic Games, 7, 343- 367.
    Open DOISearch in Google Scholar
  4. 4. Beckmann, M.J., McGuire, C.B., Winsten, C.B. (1956) Studies in the Economics of Transportation. New Haven, CT: Yale University Press.
    Search in Google Scholar
  5. 5. Bonsall, P. (1992) The influence of route guidance advice on route choice in urban networks. Transportation, 19, 1-23.
    Open DOISearch in Google Scholar
  6. 6. Charnes, A., Cooper, W.W. (1958) Extremal principles for simulating traffic flow in a network. Proceedings of the National Academy of Science of the United States of America, 44, 201-204.
    Open DOISearch in Google Scholar
  7. 7. Dafermos, S.C. (1971) An extended traffic assignment model with applications to two-way traffic. Transportation Science, 5, 366-389.
    Open DOISearch in Google Scholar
  8. 8. Dafermos, S.C., Sparrow, F.T. (1969) The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, 73B, 91-118.
    Open DOISearch in Google Scholar
  9. 9. Devarajan, S. (1981) A note on network equilibrium and noncooperative games. Transportation Research, 15B, 421-426.
    Open DOISearch in Google Scholar
  10. 10. Fisk, C.S. (1984) Game theory and transportation systems modelling. Transportation Research, 18B, 301-313.
    Open DOISearch in Google Scholar
  11. 11. Gartner, N.H. (1980) Optimal traffic assignment with elastic demands: a review. Part I. Analysis framework. Transportation Science, 14(2), 174-191.
    Search in Google Scholar
  12. 12. Haurie, A., Marcotte, P. (1985) On the relationship between Nash-Cournot and Wardrop equilibria. Networks, 15, 295-308.
    Open DOISearch in Google Scholar
  13. 13. Korilis, Y.A., Lazar, A.A. (1995) On the existence of equilibria in noncooperative optimal flow control. Journal of the Association for Computing Machinery, 42(3), 584-613.
    Open DOISearch in Google Scholar
  14. 14. Korilis, Y.A., Lazar, A.A., Orda, A. (1995) Architecting noncooperative networks. IEEE J. Selected Areas Commun., 13, 1241-1251.
    Search in Google Scholar
  15. 15. La, R.J., Anantharam, V. (1997) Optimal routing control: game theoretic approach. In: Proc. of the 36th IEEE Conference on Decision and Control, 2910-2915.
    Search in Google Scholar
  16. 16. Nash, J. (1951) Non-cooperative games. Annals of Mathematics, 54, 286-295.
    Open DOISearch in Google Scholar
  17. 17. Orda, A., Rom, R., Shimkin, N. (1993) Competitive routing in multiuser communication networks. IEEE/ACM Transactions on Networking, 1(5), 510-521.
    Open DOISearch in Google Scholar
  18. 18. Patriksson, M. (1994) The traffic assignment problem: models and methods. Utrecht, Netherlands: VSP Publishers.
    Search in Google Scholar
  19. 19. Patriksson, M. (2015) The traffic assignment problem: models and methods. N.Y., USA: Dover Publications, Inc.
    Search in Google Scholar
  20. 20. Rosenthal, R.W. (1973) The network equilibrium problem in integers. Networks, 3, 53-59.
    Open DOISearch in Google Scholar
  21. 21. Sheffi, Y. (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. N.J.: Prentice-Hall, Inc, Englewood Cliffs.
    Search in Google Scholar
  22. 22. Wardrop, J.G. (1952) Some theoretical aspects of road traffic research. Proc. Institution of Civil Engineers, 2, 325-378.
    Open DOISearch in Google Scholar
  23. 23. Xie, J., Yu, N., Yang, X. (2013) Quadratic approximation and convergence of some bush-based algorithms for the traffic assignment problem. Transportation research Part B, 56, 15-30.
    Open DOISearch in Google Scholar
  24. 24. Zakharov, V., Krylatov, A. (2014) Equilibrium Assignments in Competitive and Cooperative Traffic Flow Routing. IFIP Advances in Information and Communication Technology, 434, 641-648.
    Open DOISearch in Google Scholar
  25. 25. Zakharov, V., Krylatov, A. (2016) Competitive routing of traffic flows by navigation providers. Automation and Remote Control, 77(1), 179-189.
    Open DOISearch in Google Scholar
  26. 26. Zheng, H., Peeta, S. (2014) Cost scaling based successive approximation algorithm for the traffic assignment problem. Transportation research Part B, 68, 17-30.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.1515/ttj-2016-0019 | Journal eISSN: 1407-6179 | Journal ISSN: 1407-6160
Journal RSS Feed
Language: English
Page range: 212 - 221
Published on: Jun 28, 2016
Published by: Transport and Telecommunication Institute
In partnership with: Paradigm Publishing Services
Keywords:
competitive traffic assignment,
Nash equilibrium,
system optimum of Wardrop,
user equilibrium of Wardrop
Related subjects:
Engineering,
Introductions and overviews,
Engineering, other

© 2016 Alexander Y. Krylatov, Victor V. Zakharov, Igor G. Malygin, published by Transport and Telecommunication Institute
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 17 (2016): Issue 3 (September 2016)
Previous article
Next article