IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v274y2019i1d10.1007_s10479-018-2817-z.html
   My bibliography  Save this article

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

Author

Listed:
  • Frédéric Meunier

    (Université Paris Est, CERMICS)

  • Thomas Pradeau

    (Université Paris Est, CERMICS)

Abstract

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.

Suggested Citation

  • Frédéric Meunier & Thomas Pradeau, 2019. "Computing solutions of the multiclass network equilibrium problem with affine cost functions," Annals of Operations Research, Springer, vol. 274(1), pages 447-469, March.
    • Handle: RePEc:spr:annopr:v:274:y:2019:i:1:d:10.1007_s10479-018-2817-z
    DOI: 10.1007/s10479-018-2817-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2817-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-2817-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
    2. Rath, Kali P, 1992. "A Direct Proof of the Existence of Pure Strategy Equilibria in Games with a Continuum of Players," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(3), pages 427-433, July.
    3. Stella C. Dafermos, 1972. "The Traffic Assignment Problem for Multiclass-User Transportation Networks," Transportation Science, INFORMS, vol. 6(1), pages 73-87, February.
    4. Igal Milchtaich, 2000. "Generic Uniqueness of Equilibrium in Large Crowding Games," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 349-364, August.
    5. Michael Florian, 1977. "A Traffic Equilibrium Model of Travel by Car and Public Transit Modes," Transportation Science, INFORMS, vol. 11(2), pages 166-179, May.
    6. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    7. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    8. Patrice Marcotte & Laura Wynter, 2004. "A New Look at the Multiclass Network Equilibrium Problem," Transportation Science, INFORMS, vol. 38(3), pages 282-292, August.
    9. Florian, Michael & Spiess, Heinz, 1982. "The convergence of diagonalization algorithms for asymmetric network equilibrium problems," Transportation Research Part B: Methodological, Elsevier, vol. 16(6), pages 477-483, December.
    10. M. Seetharama Gowda & Jong-Shi Pang, 1992. "On Solution Stability of the Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 77-83, February.
    11. Mahmassani, Hani S. & Mouskos, Kyriacos C., 1988. "Some numerical results on the diagonalization algorithm for network assignment with asymmetric interactions between cars and trucks," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 275-290, August.
    12. Richard Asmuth & B. Curtis Eaves & Elmor L. Peterson, 1979. "Computing Economic Equilibria on Affine Networks with Lemke's Algorithm," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 209-214, August.
    13. Menglin Cao & Michael C. Ferris, 1996. "A Pivotal Method for Affine Variational Inequalities," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 44-64, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sung-Pil Hong & Kyung Min Kim & Suk-Joon Ko, 2021. "Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game," Annals of Operations Research, Springer, vol. 307(1), pages 207-228, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. D E Boyce, 1984. "Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects," Environment and Planning A, , vol. 16(11), pages 1445-1474, November.
    2. Vo, Khoa D. & Lam, William H.K. & Chen, Anthony & Shao, Hu, 2020. "A household optimum utility approach for modeling joint activity-travel choices in congested road networks," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 93-125.
    3. Patrice Marcotte & Laura Wynter, 2004. "A New Look at the Multiclass Network Equilibrium Problem," Transportation Science, INFORMS, vol. 38(3), pages 282-292, August.
    4. Meneguzzer, Claudio, 1995. "An equilibrium route choice model with explicit treatment of the effect of intersections," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 329-356, October.
    5. Wen-Long Jin, 2015. "Advances in Dynamic Traffic Assgmnt: TAC," Networks and Spatial Economics, Springer, vol. 15(3), pages 617-634, September.
    6. Igal Milchtaich, 2005. "Topological Conditions for Uniqueness of Equilibrium in Networks," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 225-244, February.
    7. Cantarella, Giulio Erberto & Cartenì, Armando & de Luca, Stefano, 2015. "Stochastic equilibrium assignment with variable demand: Theoretical and implementation issues," European Journal of Operational Research, Elsevier, vol. 241(2), pages 330-347.
    8. David Boyce, 2007. "Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models," Networks and Spatial Economics, Springer, vol. 7(2), pages 99-128, June.
    9. Hideo Konishi, 2004. "Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters," Transportation Science, INFORMS, vol. 38(3), pages 315-330, August.
    10. Zijun Wu & Rolf H. Moehring & Chunying Ren & Dachuan Xu, 2020. "A convergence analysis of the price of anarchy in atomic congestion games," Papers 2007.14769, arXiv.org, revised Dec 2021.
    11. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    12. Castillo González, Rodrigo & Clempner, Julio B. & Poznyak, Alexander S., 2019. "Solving traffic queues at controlled-signalized intersections in continuous-time Markov games," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 166(C), pages 283-297.
    13. Larsson, Torbjörn & Patriksson, Michael, 1995. "An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 29(6), pages 433-455, December.
    14. Anna Nagurney & Patrizia Daniele & Ladimer S. Nagurney, 2020. "Refugee migration networks and regulations: a multiclass, multipath variational inequality framework," Journal of Global Optimization, Springer, vol. 78(3), pages 627-649, November.
    15. Oran Richman & Nahum Shimkin, 2007. "Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 215-232, February.
    16. Li, Guoyuan & Chen, Anthony, 2023. "Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints," European Journal of Operational Research, Elsevier, vol. 305(1), pages 164-183.
    17. Zhou, Zhong & Chen, Anthony & Wong, S.C., 2009. "Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model," European Journal of Operational Research, Elsevier, vol. 198(1), pages 129-138, October.
    18. Arash Kaviani & Russell G. Thompson & Abbas Rajabifard & Majid Sarvi, 2020. "A model for multi-class road network recovery scheduling of regional road networks," Transportation, Springer, vol. 47(1), pages 109-143, February.
    19. Sanjiv Kapoor & Junghwan Shin, 2020. "Price of Anarchy in Networks with Heterogeneous Latency Functions," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 755-773, May.
    20. Joaquín De Cea & J. Enrique Fernández & Valérie Dekock & Alexandra Soto, 2004. "Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes," Transport Reviews, Taylor & Francis Journals, vol. 25(3), pages 293-317, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:274:y:2019:i:1:d:10.1007_s10479-018-2817-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.