Cooperation on the monte carlo rule Prison's dilemma game on the grid

Jiadong Wu; Chengye Zhao

Home/Archive/arXiv

arXiv · 1904.06949

Cooperation on the monte carlo rule Prison's dilemma game on the grid

Jiadong Wu·Chengye Zhao

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate the prison's dilemma game with monte carlo rule in the view of the idea of the classic Monte Carlo method on the grid. Monte carlo rule is an organic combination of the current dynamic rules of individual policy adjustment, which not only makes full use of information but also reflects the individual's bounded rational behavior and the ambivalence between the pursuit of high returns and high risks. In addition, it also reflects the individual's behavioral execution preferences. The implementation of monte carlo rule brings an extremely good result, higher cooperation level and stronger robustness are achieved by comparing with the unconditional imitation rule, replicator dynamics rule and fermi rule. When analyse the equilibrium density of cooperators as a function of the temptation to defect, it appears a smooth transition between the mixed state of coexistence of cooperators and defectors and the pure state of defectors when enhancing the temptation, which can be perfectly characterized by the trigonometric behavior instead of the power-law behavior discovered in the pioneer's work. When discuss the relationship between the temptation to defect and the average returns of cooperators and defectors, it is found that cooperators' average returns is almost a constant throughout the whole temptation parameter ranges while defectors' decreases as the growth of temptation. Additionally, the insensitivity of cooperation level to the initial density of cooperators and the sensitivity to the social population have been both demonstrated.

Explore related subjects

cs.GT physics.soc-ph

Keep this discovery

BibTeX RIS

Jiadong Wu, Chengye Zhao. 2019-04-15. Cooperation on the monte carlo rule Prison's dilemma game on the grid. https://arxiv.org/abs/1904.06949

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↗