Interpersonal trust: Asymptotic analysis of a stochastic coordination game with multi-agent learning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Meylahn, Benedikt V., Boer, Arnoud V. den, Mandjes, Michel
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916249893601280
author Meylahn, Benedikt V.
Boer, Arnoud V. den
Mandjes, Michel
author_facet Meylahn, Benedikt V.
Boer, Arnoud V. den
Mandjes, Michel
contents We study the interpersonal trust of a population of agents, asking whether chance may decide if a population ends up in a high trust or low trust state. We model this by a discrete time, random matching stochastic coordination game. Agents are endowed with an exponential smoothing learning rule about the behaviour of their neighbours. We find that, with probability one in the long run the whole population either always cooperates or always defects. By simulation we study the impact of the distributions of the payoffs in the game and of the exponential smoothing learning (memory of the agents). We find, that as the agent memory increases or as the size of the population increases, the actual dynamics start to resemble the expectation of the process. We conclude that it is indeed possible that different populations may converge upon high or low trust between its citizens simply by chance, though the game parameters (context of the society) may be quite telling.
format Preprint
id arxiv_https___arxiv_org_abs_2402_03894
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Interpersonal trust: Asymptotic analysis of a stochastic coordination game with multi-agent learning
Meylahn, Benedikt V.
Boer, Arnoud V. den
Mandjes, Michel
Physics and Society
General Economics
Economics
91-10, 91A22, 91D15
We study the interpersonal trust of a population of agents, asking whether chance may decide if a population ends up in a high trust or low trust state. We model this by a discrete time, random matching stochastic coordination game. Agents are endowed with an exponential smoothing learning rule about the behaviour of their neighbours. We find that, with probability one in the long run the whole population either always cooperates or always defects. By simulation we study the impact of the distributions of the payoffs in the game and of the exponential smoothing learning (memory of the agents). We find, that as the agent memory increases or as the size of the population increases, the actual dynamics start to resemble the expectation of the process. We conclude that it is indeed possible that different populations may converge upon high or low trust between its citizens simply by chance, though the game parameters (context of the society) may be quite telling.
title Interpersonal trust: Asymptotic analysis of a stochastic coordination game with multi-agent learning
topic Physics and Society
General Economics
Economics
91-10, 91A22, 91D15
url https://arxiv.org/abs/2402.03894