1 Correspondence Matrix Calculation Model

About new dynamical interpretations of entropic model of correspondence matrix calculation and Nash-Wardrop's equilibrium in Beckmann's traffic flow distribution model

1 Correspondence Matrix Calculation Model1

Assume that in some town there are districts (regions), is the number of residents living at the district , and is the number of residents working at the district . By we will denote number of residents living at the district and working at the district at the moment of time . Over course of the time numbered residents (whose quantity doesn’t alter, and is equal to ) change their apartments (homes). And we suppsose, that changes may happen only by the means of the exchange of the apartments, i.e.


Suppose, that at the time resident lives in the district and works in the district , and the resident lives in the district and works in the district . Then - is the probability for the residents with numbers and to exchange their apartments in a period of time . It’s natural to consider that probability (in the unit time) of exchanging apartments depends only on the location of the workplaces and homes, which are exchanged. For instance, it may be considered that the “distance” between district and district is , and

Then, by the virtue of the ergodic theorem for discrete homogeneous Markov process with finite number of states, for all (1) we have that

where is the normalizing multiplier.

Here we have the case where the final distribution, which is also a stationary distribution, satisfies detailed balance condition:2


Distribution on a set (1) is concentrated with (see below) in a neighborhood of the most probable value , which is determined as a solution of the following entropic –linear programming problem:


Solution of this problem might be presented as

where Lagrange multipliers (dual variables) and are determined3 from the system of equations (1). In practice we usually have some information about and . So, when we solve (2), we find

If , , then the distribution of the probabilities on the set (1) is concentrated in neighborhood of the most probable value . More precisely:

Indeed, let us note, that



we have “inequality of measure concentration”:

2 Beckmann traffic flow distribution model4

Let us consider the oriented graph , which stands for transportation route in some town ( – nodes (vertices), – arc of the network (edges)). Let be a set of pairs inlet-outlet; – route from to , if , (it will be shown later (see example by V.I. Shvetsov) that, to specify the path it may not be enough to indicate only the set of vertices. In general, one must also specify exactly which edge, connecting the specified vertices, is chosen); – set of routes in correspondence ; – collection of all routes in the network ; – flux on the way , ; – specific costs of travel on the road , ; – flux on the arc : , where (; – specific costs of travel on the arc (generally increasing, convex, smooth functions), it is natural to assume, that . Let flows on correspondences , to be known. Then , which describes flow distribution, must lie in the set:

Consider a game in which each element corresponds to a considerably big ( set of players of the same type. The set of pure strategies of such player is , and profit (minus losses) is defined by the formula (a player chooses a strategy and neglects the fact, that components of the vector and hence the profit depends slightly on his choice). One can show, that Nash equilibrium is equivalent to complementarity problem, which equivalent to a solution of variation inequality, which, in its turn equivalent to a solution of convex optimization problem.


It is easy to show, that in the case being strictly monotonic transformation, the Nash-Vardrop equilibrium is unique. If are increasing functions then is unique, although, as we will see later, isn’t necessarily unique.

The route at a step player at correspondence , choose independently according the mixed strategy with probability

to choose path (, and with probability to choose the same strategy as at the n-th step. Here – number of players at , who have chosen at the n-th step strategy , and can be found from the normalization condition. Multiplier describes the will to imitate and, also, the reliability of using this strategy. This multiplier notices specifics of the problem (without it there could be convergence to something different from the Nash-Wardrop equilibrium). Parameter describes “the conservatism”, while “the temperature” stands for “the risk appetite”.

Theorem 1

Let be sufficiently small, . Then , where is the minimizer from (3). Moreover, if the equilibrium is unique, then

In the experiments, conducted at the Laboratory of Experimental Economics in the Faculty of Applied Mathematics and Control, MIPT, in which students of the 5 course were involved, we observed the convergence to equilibrium and “vibrations” around it. Fluctuations should be explained, apparently, by the fact that in experiments the number of players was small and the hypothesis of a competitive market was not performed. We also observed, that for students it is more likely, than . As a result there will be convergence not to the equilibrium point, but to its neighborhood. Size of the neighborhood depends on , and the number of players.

Example 1 (Braess paradox, 1968 [15]) Let correspondence thousand cars/hour (see graphs on Figures 1 and 2). Weight of the edges is time delay (in minutes) when the flow on the edge is (thousand cars/hour). For example, in case 2 (see Figure 2): . It is natural that time delay (at each of the edge) is a growth function of flow.

The following example shows, that under the very natural conditions vector-function of cost of the travel can’t be strictly monotone:

This, for example, can be because of

where describes the loading of edges (arcs) of a graph of the transport network, – vector-function of cost of the travel on the edges of transport network, – incidence matrix of edges and paths, and different vectors of flow distributions may correspond to the same vector .

Figure 1: Case 1. . Total time for each path is min.
Figure 2: Case 2. . Total time for each path is min.

Example 2 (Nonuniqueness of the equilibrium; Shvetsov, 2010).
On Figure 3 the equilibrium flow distribution is shown, for all .

Figure 3: Nonuniqueness of the equilibrium.
Theorem 2

Let be sufficiently small, . Then and Note most of the elements of can be equal to zero.

We should notice, that Theorem 2 is a refutation (in case of the considered dynamics) of the hypothesis [16]. It states that in the case of non-unique Nash-Wardrop equilibrium, the equilibrium is more likely to realize, and it is a solution of the following linear-enthropy programming problem

where – is the unique solution of .

3 Sketch of the proof of the Theorem 1

Lemma 1

Let , where . — are some randomly chosen, but fixed parameters; . Let us consider functions

Then , and the equality is attained only when

The proof is based on the consequent usage of the inequality between harmonic mean and geometric mean and then Cauchy inequality.

Lemma 2

For any holds the following inequality


Without restricting the generality, we can assume that . Then

From Lemma 1 it follows that

And the equality can be attained only on the equilibrium vector , which can not be under considered hypothesis.

Remark 1

Lemma 2 can be more specified. At some neighborhood of the equilibrium there exists , such that

Also, with some reserves, we can change constraint to .

Lemma 3 ([25], Chapter 2.2)



and if the equilibrium is unique, then also

Lemma 2 and Theorem 1 from chapter 2.2 of [25] allow us to consider only the situation, when is close to . Then by Taylor formula we have:

If we take mathematical expectations from both sides of this equality, we will get that there exists sufficiently large , such that

From more general statement from [25] we get that


From Kolmogorov inequality follows

Which concludes the proof.
In the end we will formulate a known result, which is in high correlation with the proved one.

Theorem 3

Let5 . Then there


Authors thank S.A. Avvakumov, I.B. Gnedkov, Y.V. Dorn, I.S. Menshikov, E.A. Nurminskiy, A.A. Shananin, V.I. Shvetsov and especially A.V. Gasnikov.

The work was supported by RFBR 10-01-00321-a, 11-01-00494-a 11-07-00162-a. The second author is partially supported by the Laboratory for Structural Methods of Data Analysis in Predictive Modeling, MIPT, RF government grant, ag. 11.G34.31.0073


  1. This section was written, based on the works [1][11].
  2. Multipliers before probabilities, for example, in the state , arise because of the number of the ways to choose the resident, living in the district and working in the district , is , and independently the number of ways to choose the resident, living in the district and working in the district , is .
  3. This can be done in a different ways. For example, by Bregman’s balancing method or by Newton’s method [5]. The other way is to solve the dual problem for the entropy programming problem (2). There are a lot of different algorithms with the first order oracle (MART, GISM, etc. [4], [5]). It can be shown that most of this methods (including Bregman’s) are just barrier-multiplicative antigradient descending methods [11]. At the end (when the iteration process is achieving a sufficient small vicinity of the global minimum) it is worth to use the second order interior-point method, like Nesterov–Nemirovskii polynomial algorithm [12] (for so-called “separable” tasks).
  4. This section was written, based on the works [13][24].
  5. See formula (2.32), statement 2.2 and example on the page 1586 in [26]


  1. Introduction to the mathematical modeling of traffic flow / Gasnikov A.V., Klenov S.L., Nurminskiy E.A., Kholodov Y.A., Shamray N.B.; with appendices M.L. Blank, E.V. Gasnikova, A.A. Zamyatin and V.A. Malyshev, A.V. Kolesnikov, A.M. Raigorodskiy, ed. A.V. Gasnikov. M.: MIPT, 2010. 361 p. (in Russian) http://zoneos.com/traffic/
  2. Wilson A.G. (1970) Entropy in urban and regional modeling. Pion ltd., London.
  3. Jaynes E.T. (1989) Papers on probability, statistics and statistical physics. Dordrecht: Kluwer Academic Publisher.
  4. Popkov Yu.S. (1995) Macrosystems. Theory and its applications. Springer-Verlag.
  5. Fang S.-C., Rajasekera J.R., Tsao H.-S. (1997) Entropy optimization and mathematical programming. Kluwer Academic Publishers.
  6. Ledoux M.(2001) Concentration of measure phenomenon (2001). Providence, RI, Amer. Math. Soc., (Math. Surveys Monogr. V. 89).
  7. Weidlich W.(2005) Sociodynamics. A systematic approach to mathematical modeling in social sciences. Harwood Academic Publishers, 2005.
  8. Castellano C., Fortunato S., Loreto V.(2009) Statistical physics of social behavior // Review of modern physics, V. 81. 2009. P. 591-646. arXiv:0710.3256v2
  9. Batishcheva Ya.G., Vedenyapin V.V. (2005) The second law of thermodynamics for chemical kinetics // Mat. Model., V. 17. 8. 2005. P. 106-110. (in Russian)
  10. Malyshev V.A., Pirogov S.A. (2008) Reversibility and irreversibility in stochastic chemical kinetics // Uspekhi Mat. Nauk, V. 63. 1(379). 2008. P. 3-36.
  11. Gasnikova E.V. (2009) Dual multiplicative algorithms for a problem of entropy-linear programming // Zh. Vychisl. Mat. Mat. Fiz., V. 49. . 3. 2009. P. 453-464.
  12. Nesterov Yu., Nemirovskii A. (1985) Interior-point polynomial algorithms in convex programming. Philadelphia: SIAM, 1994.
  13. Sheffi Y.(1985) Urban transportation networks: Equilibrium analysis with mathematical programming methods. N.J.: Prentice–Hall Inc., Englewood Cliffs, 1985.
  14. Patriksson M. (1994) The traffic assignment problem. Models and methods. Utrecht Netherlands: VSP, 1994.
  15. Steenbrink P.A. (1974) Optimization of transport networks. John Wiley & Sons 1974
  16. Bar-Gera H. (1999) Origin-based algorithms for transportation network modeling. Univ. of Illinois at Chicago, 1999.
  17. Foster D., Young P. (1990) Stochastic evolutionary game dynamics // Theoretical population biology. 1990. V. 38. 2.
  18. Cressman R. (2003) Evolutionary game theory and extensive form games. Cambridge, Mass.: MIT Press, 2003.
  19. Hofbauer J., Sigmund K. (2003) Evolutionary game dynamics // Bulletin of the AMS. 2003. V. 40. 4. P. 479–519.
  20. McKelvey R. D., Palfrey T. R. (1998) Quantal response equilibria for extensive form games // Experimental economics. 1998. V. 1. P. 9–41.
  21. Marsili M. (2001) Toy models of markets with heterogeneous interacting agents // e-print www.unifr.ch/econophysics/, 2001.
  22. Fogel D. (2000) B. Evolutionary Computation: Towards a New Philosophy of Machine Intelligence. New York: IEEE Press, 2000.
  23. Como G., Salva K., Acemoglu D., Dahleh M.A., Frazzoli E. (2011) Stability analysis of transportation networks with multiscale driver decisions // e-print arXiv:1101.2220v1.
  24. Nesterov Yu. De Palma A. (2003) Stationary dynamic solutions in congested transportation networks: summary and perspectives // Networks and Spatial Economics, V. 3. 2003. P. 371-395.
  25. Polyak B.T. (1987) Introduction to Optimization. Optimization Software Inc., 1987.
  26. Juditsky A., Lan G., Nemirovskii A., Shapiro A. (2009) Stochastic approximation approach to stochastic programming // SIAM Journal on Optimization, 2009. V. 19. 4. P. 1574–1609. http://www2.isye.gatech.edu/nemirovs/
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description