IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2604.03625.html

Overcoming unfairness via repeated interactions in mini-ultimatum game

Author

Listed:
  • Prosanta Mandal
  • Arunava Patra
  • Sagar Chakraborty

Abstract

Repeated interactions are ubiquitous and known to promote social behaviour. While research often focuses on cooperation in the Prisoner's Dilemma, experimental evidence suggests repeated interactions also foster fairness. This study addresses a gap in the literature by theoretically modelling the evolution of fairness within a repeated mini-ultimatum game. Specifically, we construct a repeated-game framework where offerers and accepters interact using reactive strategies. We then investigate whether fair reactive strategy pairs are resilient against unfair mutants in a two-species population. By analyzing short-term evolutionary stability via the concept of two-species evolutionary stable strategy, we identify a critical effective game length: below this value, fairness is promoted by offerers and accepters who comply with their partner's past actions. Above this critical value, fairness is maintained by `complier' offerers and fair accepters. We also show that specific reactive strategies effectively facilitate the emergence and sustenance of fairness in long-term mutation-selection dynamics. To this end, we develop a two-population stochastic dynamics model -- a generalization of classical adaptive dynamics -- that accounts for finite population sizes and non-local mutants in the reactive strategy space.

Suggested Citation

  • Prosanta Mandal & Arunava Patra & Sagar Chakraborty, 2026. "Overcoming unfairness via repeated interactions in mini-ultimatum game," Papers 2604.03625, arXiv.org.
  • Handle: RePEc:arx:papers:2604.03625
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2604.03625
    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:2604.03625. 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.