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

When is Trust Robust?

Author

Listed:
  • Luca Anderlini
  • Larry Samuelson
  • Daniele Terlizzese

Abstract

We examine an economy in which interactions are more productive if agents can trust others to refrain from cheating. Some agents are scoundrels, who always cheat, while others cheat only if the cost of cheating, a decreasing function of the proportion of cheaters, is sufficiently low. The economy exhibits multiple equilibria. As the proportion of scoundrels in the economy declines, the high-trust equilibrium can be disrupted by arbitrarily small perturbations or infusions of low-trust agents, while the low-trust equilibrium becomes impervious to perturbations and infusions of high-trust agents. The resilience of trust may thus hinge upon the prevalence of scoundrels.

Suggested Citation

  • Luca Anderlini & Larry Samuelson & Daniele Terlizzese, 2024. "When is Trust Robust?," Papers 2403.12917, arXiv.org.
    • Handle: RePEc:arx:papers:2403.12917
    as

    Download full text from publisher

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

    Other versions of this item:

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
    • D02 - Microeconomics - - General - - - Institutions: Design, Formation, Operations, and Impact
    • D80 - Microeconomics - - Information, Knowledge, and Uncertainty - - - General

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