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

A game played by tandem-running ants: Hint of procedural rationality

Author

Listed:
  • Joy Das Bairagya
  • Udipta Chakraborti
  • Sumana Annagiri
  • Sagar Chakraborty

Abstract

Navigation through narrow passages during colony relocation by the tandem-running ants, $\textit{Diacamma}$ $\textit{indicum}$, is a tour de force of biological traffic coordination. Even on one-lane paths, the ants tactfully manage a bidirectional flow: Informed individuals (termed leaders) guide nest-mates (termed followers) from a suboptimal nest to a new optimal nest, and then return to recruit additional followers. We propose that encounters between the ants moving in opposite directions can be modelled within the framework of game theory leading to an understanding of the mechanism behind observed behaviours. Our experiments reveal that, upon encountering a tandem pair (a leader and its follower) on a narrow path, the returning leader reverses her direction and proceeds toward the new nest again as if she becomes the leader guiding a follower. This observed behaviour is consistent with game-theoretic predictions, provided the assumption of perfect rationality is relaxed in favour of bounded rationality -- specifically, procedural rationality. In other words, the experimental outcomes are consistent with sampling equilibrium but not with Nash equilibrium. Our work, which strives to induct the essence of behavioural game theory into the world of ants, is first ever report of realizing sampling equilibrium in scenarios not involving human players.

Suggested Citation

  • Joy Das Bairagya & Udipta Chakraborti & Sumana Annagiri & Sagar Chakraborty, 2025. "A game played by tandem-running ants: Hint of procedural rationality," Papers 2509.17147, arXiv.org.
  • Handle: RePEc:arx:papers:2509.17147
    as

    Download full text from publisher

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

    More about this item

    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:2509.17147. 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.