Geodesic
Game-theoretic approach for modeling of selfish and group routing
Contributions to game theory and management, Tome 10 (2017), pp. 162-174.

Voir la notice de l'article provenant de la source Math-Net.Ru

The development of methodological tools for modeling of traffic flow assignment is crucial issue since traffic conditions influence significantly on quality of life nowadays. Herewith no secret that the development of invehicle route guidance and information systems could impact significantly on route choice as soon as it is highly believed that they are able to reduce congestion in an urban traffic area. Networks’ users join groups of drivers who rely on the same route guidance system. Therefore, present paper is devoted to discussing approaches for modeling selfish and group routing. Network performance is deeply associated with competition between users of networks. So, the emphasis in our discussion is placed on game-theoretic approaches for appropriate modeling.
Keywords: traffic assignment problem, selfish routing, user equilibrium of Wardrop, group routing, Nash equilibrium, system optimum of Wardrop. 
@article{CGTM_2017_10_a11,
     author = {Alexander Yu. Krylatov and Victor V. Zakharov},
     title = {Game-theoretic approach for modeling of selfish and group routing},
     journal = {Contributions to game theory and management},
     pages = {162--174},
     publisher = {mathdoc},
     volume = {10},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2017_10_a11/}
}
TY  - JOUR
AU  - Alexander Yu. Krylatov
AU  - Victor V. Zakharov
TI  - Game-theoretic approach for modeling of selfish and group routing
JO  - Contributions to game theory and management
PY  - 2017
SP  - 162
EP  - 174
VL  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2017_10_a11/
LA  - en
ID  - CGTM_2017_10_a11
ER  - 
%0 Journal Article
%A Alexander Yu. Krylatov
%A Victor V. Zakharov
%T Game-theoretic approach for modeling of selfish and group routing
%J Contributions to game theory and management
%D 2017
%P 162-174
%V 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2017_10_a11/
%G en
%F CGTM_2017_10_a11
Alexander Yu. Krylatov; Victor V. Zakharov. Game-theoretic approach for modeling of selfish and group routing. Contributions to game theory and management, Tome 10 (2017), pp. 162-174. http://geodesic.mathdoc.fr/item/CGTM_2017_10_a11/

[1] Altman E., Basar T., Jimenez T., Shimkin N., “Competitive routing in networks with polynomial costs”, IEEE Transactions on automatic control, 47:1 (2002), 92–96 | DOI | MR | Zbl

[2] Altman E., Combes R., Altman Z., Sorin S., “Routing games in the many players regime”, Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, 2011, 525–527

[3] Altman E., Kameda H., “Equilibria for multiclass routing problems in multi-agent networks”, Advances in Dynamic Games, 7 (2005), 343–367 | DOI | MR | Zbl

[4] Beckmann M. J., McGuire C. B., Winsten C. B., Studies in the Economics of Transportation, Yale University Press, New Haven, CT, 1956

[5] Bonsall P., “The influence of route guidance advice on route choice in urban networks”, Transportation, 19 (1992), 1–23 | DOI

[6] Charnes A., Cooper W. W., “Extremal principles for simulating traffic flow in a network”, Proceedings of the National Academy of Science of the United States of America, 44 (1958), 201–204 | DOI | MR | Zbl

[7] Dafermos S. C., “An extended traffic assignment model with applications to two-way traffic”, Transportation Science, 5 (1971), 366–389 | DOI

[8] Dafermos S. C., Sparrow F. T., “The traffic assignment problem for a general network”, Journal of Research of the National Bureau of Standards, 73B (1969), 91–118 | MR | Zbl

[9] Devarajan S., “A note on network equilibrium and noncooperative games”, Transportation Research, 15B (1981), 421–426 | DOI | MR

[10] Fisk C. S., “Game theory and transportation systems modelling”, Transportation Research, 18B (1984), 301–313 | DOI | MR

[11] Gartner N. H., “Optimal traffic assignment with elastic demands: a review. Part I. Analysis framework”, Transportation Science, 14:2 (1980), 174–191 | DOI | MR

[12] Haurie A., Marcotte P., “On the relationship between Nash-Cournot and Wardrop equilibria”, Networks, 15 (1985), 295–308 | DOI | MR | Zbl

[13] Korilis Y. A., Lazar A. A., “On the existence of equilibria in noncooperative optimal flow control”, Journal of the Association for Computing Machinery, 42:3 (1995), 584–613 | DOI | MR | Zbl

[14] Korilis Y. A., Lazar A. A., Orda A., “Architecting noncooperative networks”, IEEE J. Selected Areas Commun., 13 (1995), 1241–1251 | DOI

[15] Krylatov A. Y., Zakharov V. V., Malygin I. G., “Competitive Traffic Assignment in Road Networks”, Transport and Telecommunication, 17:3 (2016), 212–221 | MR

[16] La R. J., Anantharam V., “Optimal routing control: game theoretic approach”, Proc. of the 36th IEEE Conference on Decision and Control, 1997, 2910–2915 | MR

[17] Nash J., “Non-cooperative games”, Annals of Mathematics, 54 (1951), 286–295 | DOI | MR | Zbl

[18] Orda A., Rom R., Shimkin N., “Competitive routing in multiuser communication networks”, IEEE/ACM Transactions on Networking, 1:5 (1993), 510–521 | DOI

[19] Patriksson M., The traffic assignment problem: models and methods, VSP Publishers, Utrecht, Netherlands, 1994

[20] Patriksson M., The traffic assignment problem: models and methods, Dover Publications, Inc., N.Y., USA, 2015

[21] Rosenthal R. W., “The network equilibrium problem in integers”, Networks, 3 (1973), 53–59 | DOI | MR | Zbl

[22] Roughgarden T., Selfish Routing and the Price of Anarchy, MIT Press, 2005 | MR

[23] Sheffi Y., Urban transportation networks: equilibrium analysis with mathematical programming methods, Prentice-Hall, Inc., N.J., USA, 1985

[24] Wardrop J. G., “Some theoretical aspects of road traffic research”, Proc. Institution of Civil Engineers, 2 (1952), 325–378 | DOI

[25] Xie J., Yu N., Yang X., “Quadratic approximation and convergence of some bush-based algorithms for the traffic assignment problem”, Transportation research Part B, 56 (2013), 15–30 | DOI

[26] Zakharov V., Krylatov A., “Competitive routing of traffic flows by navigation providers”, Automation and Remote Control, 77:1 (2016), 179–189 | DOI | MR | Zbl

[27] Zheng H., Peeta S., “Cost scaling based successive approximation algorithm for the traffic assignment problem”, Transportation research Part B, 68 (2014), 17–30 | DOI