IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v658y2025ics0378437124007751.html
   My bibliography  Save this article

Re-routing game: The inadequacy of mean-field approach in modeling the herd behavior in path switching

Author

Listed:
  • Po, Ho Fai
  • Yeung, Chi Ho

Abstract

Coordination of vehicle routes is a feasible way to ease traffic congestion issues amid a fixed road infrastructure. Nevertheless, even when optimal route configurations are provided to individual drivers, it is hard to achieve due to the fact that greedy drivers may switch to other routes to lower individual costs. Recent research uses a mean-field cavity approach from spin glass studies to analyze the impact of path switching in optimized transportation networks. However, this method only provides a mean-field approximation, which does not account for the collective herd behavior in path switching due to uncoordinated individual decisions. In this study, we propose an exhaustive cavity approach to investigate the impact of uncoordinated path switching in a re-routing game and reveal that greedy drivers’ decisions can be highly correlated, leading to the failure of mean-field approaches. Our theoretical results fit well with simulations, and our developed framework can be generalized to analyze other games with multiple players and rounds. Our results shed light on the impact of herd behavior among uncoordinated human drivers in suppressing congestion through path coordination.

Suggested Citation

  • Po, Ho Fai & Yeung, Chi Ho, 2025. "Re-routing game: The inadequacy of mean-field approach in modeling the herd behavior in path switching," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 658(C).
    • Handle: RePEc:eee:phsmap:v:658:y:2025:i:c:s0378437124007751
    DOI: 10.1016/j.physa.2024.130266
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437124007751
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2024.130266?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. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
    Full references (including those not matched with items on IDEAS)

    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. Hoang, Nam H. & Vu, Hai L. & Lo, Hong K., 2018. "An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 207-230.
    2. Daron Acemoglu & Asuman Ozdaglar, 2005. "Competition and Efficiency in Congested Markets," NBER Working Papers 11201, National Bureau of Economic Research, Inc.
    3. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    4. Parilina, Elena & Sedakov, Artem & Zaccour, Georges, 2017. "Price of anarchy in a linear-state stochastic dynamic game," European Journal of Operational Research, Elsevier, vol. 258(2), pages 790-800.
    5. Vincenzo Bonifaci & Tobias Harks & Guido Schäfer, 2010. "Stackelberg Routing in Arbitrary Networks," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 330-346, May.
    6. José R. Correa & Nicolás Figueroa & Nicolás E. Stier-Moses, 2008. "Pricing with markups in industries with increasing marginal costs," Documentos de Trabajo 256, Centro de Economía Aplicada, Universidad de Chile.
    7. Gaëtan Fournier & Marco Scarsini, 2014. "Hotelling Games on Networks: Efficiency of Equilibria," Documents de travail du Centre d'Economie de la Sorbonne 14033, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    8. Pieter Kleer, 2023. "Price of anarchy for parallel link networks with generalized mean objective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 27-55, March.
    9. Andrea Manno & Laura Palagi & Simone Sagratella, 2018. "Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training," Computational Optimization and Applications, Springer, vol. 71(1), pages 115-145, September.
    10. Li, Song-Song, 2018. "Efficiency analysis with respect to the unit cost objectives in scheduling games," Mathematical Social Sciences, Elsevier, vol. 94(C), pages 13-18.
    11. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
    12. Marco Scarsini & Tristan Tomala, 2012. "Repeated congestion games with bounded rationality," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(3), pages 651-669, August.
    13. Thanasis Lianeas & Evdokia Nikolova & Nicolas E. Stier-Moses, 2019. "Risk-Averse Selfish Routing," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 38-57, February.
    14. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    15. Georgia Perakis & Guillaume Roels, 2007. "The Price of Anarchy in Supply Chains: Quantifying the Efficiency of Price-Only Contracts," Management Science, INFORMS, vol. 53(8), pages 1249-1268, August.
    16. Luan, Xiaojie & Eikenbroek, Oskar A.L. & Corman, Francesco & van Berkum, Eric C., 2024. "Passenger social rerouting strategies in capacitated public transport systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    17. Cominetti, Roberto & Dose, Valerio & Scarsini, Marco, 2024. "Phase transitions of the price-of-anarchy function in multi-commodity routing games," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).
    18. He, Zhidong & Navneet, Kumar & van Dam, Wirdmer & Van Mieghem, Piet, 2021. "Robustness assessment of multimodal freight transport networks," Reliability Engineering and System Safety, Elsevier, vol. 207(C).
    19. Huibing Yin & Prashant Mehta & Sean Meyn & Uday Shanbhag, 2014. "On the Efficiency of Equilibria in Mean-Field Oscillator Games," Dynamic Games and Applications, Springer, vol. 4(2), pages 177-207, June.
    20. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.

    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:eee:phsmap:v:658:y:2025:i:c:s0378437124007751. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.