IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2409.11908.html
   My bibliography  Save this paper

Cognitive Hierarchy in Day-to-day Network Flow Dynamics

Author

Listed:
  • Minyu Shen
  • Feng Xiao
  • Weihua Gu
  • Hongbo Ye

Abstract

When making route decisions, travelers may engage in a certain degree of reasoning about what the others will do in the upcoming day, rendering yesterday's shortest routes less attractive. This phenomenon was manifested in a recent virtual experiment that mimicked travelers' repeated daily trip-making process. Unfortunately, prevailing day-to-day traffic dynamical models failed to faithfully reproduce the collected flow evolution data therein. To this end, we propose a day-to-day traffic behavior modeling framework based on the Cognitive Hierarchy theory, in which travelers with different levels of strategic-reasoning capabilities form their own beliefs about lower-step travelers' capabilities when choosing their routes. Two widely-studied day-to-day models, the Network Tatonnement Process dynamic and the Logit dynamic, are extended into the framework and studied as examples. Calibration of the virtual experiment is performed using the extended Network Tatonnement Process dynamic, which fits the experimental data reasonably well. We show that the two extended dynamics have multiple equilibria, one of which is the classical user equilibrium. While analyzing global stability is intractable due to the presence of multiple equilibria, local stabilities near equilibria are developed analytically and verified by numerical experiments. General insights on how key parameters affect the stability of user equilibria are unveiled.

Suggested Citation

  • Minyu Shen & Feng Xiao & Weihua Gu & Hongbo Ye, 2024. "Cognitive Hierarchy in Day-to-day Network Flow Dynamics," Papers 2409.11908, arXiv.org.
  • Handle: RePEc:arx:papers:2409.11908
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2409.11908
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2409.11908. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.