The Impact of Irrational Behaviours in the Optional Prisoner's Dilemma with Game-Environment Feedback

Leonardo Stella; Dario Bauso

Home/Archive/arXiv

arXiv · 2106.07100

The Impact of Irrational Behaviours in the Optional Prisoner's Dilemma with Game-Environment Feedback

Leonardo Stella·Dario Bauso

View original source ↗Read source document ↗Export metadata ↓

Abstract

In the optional prisoner's dilemma (OPD), players can choose to cooperate and defect as usual, but can also abstain as a third possible strategy. This strategy models the players' participation in the game and is a relevant aspect in many settings, e.g. social networks or opinion dynamics where abstention is an option during an election. In this paper, we provide a formulation of the OPD where we consider irrational behaviours in the population inspired by prospect theory. Prospect theory has gained increasing popularity in recent times thanks to its ability to capture aspects such as reference dependence or loss aversion which are common in human behaviour. This element is original in our formulation of the game and is incorporated in our framework through pairwise comparison dynamics. Recently, the impact of the environment has been studied in the form of feedback on the population dynamics. Another element of novelty in our work is the extension of the game-environment feedback to the OPD in two forms of dynamics, the replicator and the pairwise comparison. The contribution of this paper is threefold. First, we propose a modelling framework where prospect theory is used to capture irrational behaviours in an evolutionary game with game-environment feedback. Second, we carry out the stability analysis of the system equilibria and discuss the oscillating behaviours arising from the game-environment feedback. Finally, we extend our previous results to the OPD and we discuss the main differences between the model resulting from the replicator dynamics and the one resulting from the pairwise comparison dynamics.

Explore related subjects

cs.GT

Keep this discovery

BibTeX RIS

Leonardo Stella, Dario Bauso. 2021-06-13. The Impact of Irrational Behaviours in the Optional Prisoner's Dilemma with Game-Environment Feedback. https://arxiv.org/abs/2106.07100

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗

arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗

arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗