Annals of Operations Research

, Volume 274, Issue 1–2, pp 447–469 | Cite as

Computing solutions of the multiclass network equilibrium problem with affine cost functions

  • Frédéric MeunierEmail author
  • Thomas Pradeau
Original Research


We consider a non-atomic congestion game on a graph, with several classes of players. Each player wants to go from his origin vertex to his destination vertex at the minimum cost and all players of a given class share the same characteristics: cost functions on each arc, and origin–destination pair. Under some mild conditions, it is known that a Nash equilibrium exists, but the computation of such an equilibrium in the multiclass case is an open problem for general functions. We consider the specific case where the cost functions are affine. We show that this problem is polynomially solvable when the number of vertices and the number of classes are fixed. In particular, it shows that the parallel two-terminal case with a fixed number of classes is polynomially solvable. On a more practical side, we propose an extension of Lemke’s algorithm able to solve this problem.


Affine cost functions Complexity results Hyperplane arrangement Lemke algorithm Network congestion games 

Mathematics Subject Classification

90C33 91A43 90B06 



The authors would like to thank the reviewer for the thorough reading and the useful comments, which helped to improve the presentation and to clarify some imprecise statements.


  1. Aashtiani, H. Z., & Magnanti, T. L. (1981). Equilibria on a congested transportation network. SIAM Journal of Algebraic Discrete Methods, 2, 213–226.CrossRefGoogle Scholar
  2. Adler, I., & Verma, S. (2011). The linear complementarity problem, Lemke algorithm, perturbation, and the complexity class PPAD. Optimization Online.Google Scholar
  3. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Upper Saddle River: Prentice-Hall.Google Scholar
  4. Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., & Wynter, L. (2006). A survey on networking games in telecommunications. Computers & Operations Research, 33(2), 286–311.CrossRefGoogle Scholar
  5. Asmuth, R., Eaves, B. C., & Peterson, E. L. (1979). Computing economic equilibria on affine networks with Lemke’s algorithm. Mathematics of Operations Research, 4(3), 209–214.CrossRefGoogle Scholar
  6. Beckmann, M., McGuire, C. B., & Winsten, C. B. (1956). Studies in economics of transportation. New Haven, CT: Yale University Press.Google Scholar
  7. Cao, M., & Ferris, M. C. (1996). A pivotal method for affine variational inequalities. Mathematics of Operations Research, 21, 44–64.CrossRefGoogle Scholar
  8. Chen, X., Deng, X., & Ten, S.-H. (2009). Settling the complexity of computing two-player Nash equilibria. Journal of the ACM.
  9. Chvátal, V. (1983). Linear programming. New York: W.H. Freeman.Google Scholar
  10. Cohen, G., & Chaplais, F. (1988). Nested monotonicity for variational inequalities over product of spaces and convergence of iterative algorithms. Journal of Optimization Theory and Applications, 59, 369–390.CrossRefGoogle Scholar
  11. Cottle, R. W., Pang, J. S., & Stone, R. E. (1992). The linear complementarity problem. Cambridge: Academic Press.Google Scholar
  12. Dafermos, S. (1972). The traffic assignment problem for multiclass-user transportation networks. Transportation Science, 6, 73–87.CrossRefGoogle Scholar
  13. Dafermos, S. (1980). Traffic equilibrium and variational inequalities. Transportation Science, 14, 42–54.CrossRefGoogle Scholar
  14. Devanur, N. R., & Kannan, R. (2008). Market equilibria in polynomial time for fixed number of goods or agents. In FOCS 2008.Google Scholar
  15. Eaves, B. (1973). Polymatrix games with joint constraints. SIAM Journal on Applied Mathematics, 24, 418–423.CrossRefGoogle Scholar
  16. Edelsbrunner, H. (1987). Algorithm in combinatorial geometry (Vol. 10)., EATCS monographs on theoretical computer science Berlin: Springer.CrossRefGoogle Scholar
  17. Edelsbrunner, H., O’Rourke, J., & Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing, 15, 341–363.CrossRefGoogle Scholar
  18. Fabrikant, A., Papadimitriou, C., & Talwar, K. (2004). The complexity of pure Nash equilibria. In STOC’04.Google Scholar
  19. Florian, M. (1977). A traffic equilibrium model of travel by car and public transit modes. Transportation Science, 11, 166–179.CrossRefGoogle Scholar
  20. Florian, M. (1999). Untangling traffic congestion: Application of network equilibrium models in transportation planning. OR/MS Today, 26, 52–57.Google Scholar
  21. Florian, M., & Spiess, H. (1982). The convergence of diagonalisation algorithms for asymmetric network equilibrium problems. Transportation Research Part B, 16, 477–483.CrossRefGoogle Scholar
  22. Fortune, S., Hopcroft, J., & Wyllie, J. (1980). The directed subgraph homeomorphism problem. Theoretical Computer Science, 10, 267–283.CrossRefGoogle Scholar
  23. Harker, P. (1988). Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Mathematical Programming, 48, 29–59.CrossRefGoogle Scholar
  24. Mahmassani, H. S., & Mouskos, K. C. (1988). Some numerical results on the diagonalization algorithm for network assignment with asymmetric interactions between cars and trucks. Transportation Research Part B, 22, 275–290.CrossRefGoogle Scholar
  25. Marcotte, P., & Wynter, L. (2004). A new look at the multiclass network equilibrium problem. Transportation Science, 38, 282–292.CrossRefGoogle Scholar
  26. Maros, I. (2003). Computational techniques of the simplex method (Vol. 61)., International series in operations research & management science Boston, MA: Kluwer Academic Publishers.Google Scholar
  27. Matoušek, J. (2002). Lectures on discrete geometry. Berlin: Springer.CrossRefGoogle Scholar
  28. Megiddo, N., & Chandrasekaran, R. (1989). On the \(\varepsilon \)-perturbation method for avoiding degeneracy. Operations Research Letters, 8, 305–308.CrossRefGoogle Scholar
  29. Meunier, F., & Pradeau, T. (2013). A Lemke-like algorithm for the multiclass network equilibrium problem. In Proceedings of the 9th conference on web and internet economics (WINE) (pp. 363–376). Springer.Google Scholar
  30. Milchtaich, I. (1996). Congestion games with player-specific payoff functions. Games Economic Behavior, 13, 111–124.CrossRefGoogle Scholar
  31. Milchtaich, I. (2000). Generic uniqueness of equilibrium in large crowding games. Mathematics of Operations Research, 25, 349–364.CrossRefGoogle Scholar
  32. Milchtaich, I. (2006). The equilibrium existence problem in finite network congestion games. Lecture Notes in Computer Science, 4286, 87–98.CrossRefGoogle Scholar
  33. Nash, J. F. (1951). Non-cooperative games. Annals of Mathematics, 54, 286–295.CrossRefGoogle Scholar
  34. Ortuzar, J. D., & Willumsen, L. G. (2001). Modelling transport (3rd ed.). Wiley.Google Scholar
  35. Papadimitriou, C. (1994). On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48, 498–532.CrossRefGoogle Scholar
  36. Rath, K. P. (1992). A direct proof of the existence of pure strategy equilibria in games with a continuum of players. Economic Theory, 2, 427–433.CrossRefGoogle Scholar
  37. Rosenthal, R. W. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2, 65–67.CrossRefGoogle Scholar
  38. Schiro, D. A., Pang, J. S., & Shanbhag, U. V. (2013). On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke’s method. Mathematical Programming, 142, 1–46.CrossRefGoogle Scholar
  39. Schmeidler, D. (1970). Equilibrium points on nonatomic games. Journal of Statistical Physics, 7, 295–300.CrossRefGoogle Scholar
  40. Schrijver, A. (2003). Combinatorial optimization, polyhedra and efficiency. Berlin: Springer.Google Scholar
  41. Smith, M. J. (1979). The existence, uniqueness, and stability of traffic equilibria. Transportation Research Part B, 15, 443–451.CrossRefGoogle Scholar
  42. Wardrop, J. G. (1952). Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, 2, 325–378.CrossRefGoogle Scholar
  43. Wright, S. (1997). Primal-dual interior-point methods. Philadelphia: SIAM Publication.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Université Paris Est, CERMICSMarne-la-ValléeFrance

Personalised recommendations