Supervised cooperation on interdependent public goods games

December 14, 2024 Β· Declared Dead Β· πŸ› Applied Mathematics and Computation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ting Ling, Zhang Li, Minyu Feng, Attila Szolnoki arXiv ID 2412.10873 Category physics.soc-ph Cross-listed cs.SI Citations 11 Venue Applied Mathematics and Computation Last Checked 3 months ago
Abstract
It is a challenging task to reach global cooperation among self-interested agents, which often requires sophisticated design or usage of incentives. For example, we may apply supervisors or referees who are able to detect and punish selfishness. As a response, defectors may offer bribes for corrupt referees to remain hidden, hence generating a new conflict among supervisors. By using the interdependent network approach, we model the key element of the coevolution between strategy and judgment. In a game layer, agents play public goods game by using one of the two major strategies of a social dilemma. In a monitoring layer, supervisors follow the strategy change and may alter the income of competitors. Fair referees punish defectors while corrupt referees remain silent for a bribe. Importantly, there is a learning process not only among players but also among referees. Our results suggest that large fines and bribes boost the emergence of cooperation by significantly reducing the phase transition threshold between the pure defection state and the mixed solution where competing strategies coexist. Interestingly, the presence of bribes could be as harmful for defectors as the usage of harsh fines. The explanation of this system behavior is based on a strong correlation between cooperators and fair referees, which is cemented via overlapping clusters in both layers.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted