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

Evolution of trust in structured populations

Author

Listed:
  • Wang, Chaoqian

Abstract

The trust game, derived from an economics experiment, has recently attracted interest in the field of evolutionary dynamics. In a recent version of the evolutionary trust game, players adopt one of three strategies: investor, trustworthy trustee, or untrustworthy trustee. Trustworthy trustees enhance and share the investment with the investor, whereas untrustworthy trustees retain the full amount, betraying the investor. Following this setup, we investigate a two-player trust game, which is analytically feasible under weak selection. We explore the evolution of trust in structured populations, factoring in four strategy updating rules: pairwise comparison (PC), birth-death (BD), imitation (IM), and death-birth (DB). Comparing structured populations with well-mixed populations, we arrive at two main conclusions. First, in the absence of untrustworthy trustees, there is a saddle point between investors and trustworthy trustees, with collaboration thriving best in well-mixed populations. The collaboration diminishes sequentially from DB to IM to PC/BD updating rules in structured populations. Second, an invasion of untrustworthy trustees makes this saddle point unstable and leads to the extinction of investors. The 3-strategy system stabilizes at an equilibrium line where the trustworthy and untrustworthy trustees coexist. The stability span of trustworthy trustees is maximally extended under the PC and BD updating rules in structured populations, while it decreases in a sequence from IM to DB updating rules, with the well-mixed population being the least favorable. This research thus adds an analytical lens to the evolution of trust in structured populations.

Suggested Citation

  • Wang, Chaoqian, 2024. "Evolution of trust in structured populations," Applied Mathematics and Computation, Elsevier, vol. 471(C).
  • Handle: RePEc:eee:apmaco:v:471:y:2024:i:c:s0096300324000675
    DOI: 10.1016/j.amc.2024.128595
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324000675
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2024.128595?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.

    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:apmaco:v:471:y:2024:i:c:s0096300324000675. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.