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.
This work was supported by the Russian Science Foundation (project no. 14-50-00150) (see Sections 4--6), by the Russian Foundation for Basic Research (project no. 15-31-70001-mol_a_mos), and by a grant from the President of the Russian Federation (MK-1806.2017.9) (see Section 4).
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