Spatial public goods games with queueing and reputation

TL;DR

This paper introduces a spatial public goods game model incorporating queueing dynamics and reputation, revealing how certain parameters promote cooperation in social networks.

Contribution

It presents a novel integration of queueing theory and reputation mechanisms into public goods games, addressing asynchrony in player interactions.

Findings

High arrival rates promote cooperation.

Reputation mechanisms enhance cooperative behavior.

Queueing dynamics influence public goods provisioning.

Abstract

In real-world social and economic systems, the provisioning of public goods generally entails continuous interactions among individuals, with decisions to cooperate or defect being influenced by dynamic factors such as timing, resource availability, and the duration of engagement. However, the traditional public goods game ignores the asynchrony of the strategy adopted by players in the game. To address this problem, we propose a spatial public goods game that integrates an M/M/1 queueing system to simulate the dynamic flow of player interactions. We use a birth-death process to characterize the stochastic dynamics of this queueing system, with players arriving following a Poisson process and service times being exponentially distributed under a first-come-first-served basis with finite queue capacity. We also incorporate reputation so that players who have cooperated in the past are more likely to be chosen for future interactions. Our research shows that a high arrival rate, low service rate, and the reputation mechanism jointly facilitate the emergence of cooperative individuals in the network, which thus provides an interesting and new perspective for the provisioning of public goods.