|
This article is cited in 15 scientific papers (total in 15 papers)
Universal method of searching for equilibria and stochastic equilibria in transportation networks
D. R. Baymurzinaab, A. V. Gasnikovac, E. V. Gasnikovaa, P. E. Dvurechenskiicd, E. I. Ershovc, M. B. Kubentayevaa, A. A. Lagunovskayaa a Moscow Institute of Physics and Technology, Dolgoprudnyi, Moscow oblast, 141700 Russia
b Skolkovo Innovation Center, Moscow, 143026 Russia
c Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, 127051 Russia
d 10117 Berlin, Mohrenstr, 39, WIAAS, Germany
Abstract:
A universal method of searching for usual and stochastic equilibria in congestion population games is proposed. The Beckmann and stable dynamics models of an equilibrium flow distribution over paths are considered. A search for Nash(-Wardrop) stochastic equilibria leads to entropy-regularized convex optimization problems. Efficient solutions of such problems, more exactly, of their duals are sought by applying a recently proposed universal primal-dual gradient method, which is optimally and adaptively tuned to the smoothness of the problem under study.
Key words:
transportation flows, transportation networks, universal method of similar triangles, dual problem, Beckmann’s model, stable dynamics model.
Received: 19.01.2017 Revised: 04.12.2017
Citation:
D. R. Baymurzina, A. V. Gasnikov, E. V. Gasnikova, P. E. Dvurechenskii, E. I. Ershov, M. B. Kubentayeva, A. A. Lagunovskaya, “Universal method of searching for equilibria and stochastic equilibria in transportation networks”, Zh. Vychisl. Mat. Mat. Fiz., 59:1 (2019), 21–36; Comput. Math. Math. Phys., 59:1 (2019), 19–33
Linking options:
https://www.mathnet.ru/eng/zvmmf10814 https://www.mathnet.ru/eng/zvmmf/v59/i1/p21
|
Statistics & downloads: |
Abstract page: | 255 | References: | 24 |
|