GRPO-GCC: Enhancing Cooperation in Spatial Public Goods Games via Group Relative Policy Optimization with Global Cooperation Constraint

Zhaoqilin Yang, Chanchan Li, Tianqi Liu, Hongxin Zhao, Youliang Tian
10/7/2025
cs.MAcs.GT

No official code found. Best implementation: geek12138/GRPO-GCC (0 stars, last commit 2025-12-23).

Abstract

Inspired by the principle of self-regulating cooperation in collective institutions, we propose the Group Relative Policy Optimization with Global Cooperation Constraint (GRPO-GCC) framework. This work is the first to introduce GRPO into spatial public goods games, establishing a new deep reinforcement learning baseline for structured populations. GRPO-GCC integrates group relative policy optimization with a global cooperation constraint that strengthens incentives at intermediate cooperation levels while weakening them at extremes. This mechanism aligns local decision making with sustainable collective outcomes and prevents collapse into either universal defection or unconditional cooperation. The framework advances beyond existing approaches by combining group-normalized advantage estimation, a reference-anchored KL penalty, and a global incentive term that dynamically adjusts cooperative payoffs. As a result, it achieves accelerated cooperation onset, stabilized policy adaptation, and long-term sustainability. GRPO-GCC demonstrates how a simple yet global signal can reshape incentives toward resilient cooperation, and provides a new paradigm for multi-agent reinforcement learning in socio-technical systems.

View on arXivView PDF

Code Implementations(1)

geek12138/GRPO-GCCCommunity60%

GRPO-GCC: Enhancing Cooperation in Spatial Public Goods Games via Group Relative Policy Optimization with Global Cooperation Constraint

00PythonOct 16, 202510 months ago

Similar Papers

Cite this paper

@article{yang2025grpogcc,
  title  = {GRPO-GCC: Enhancing Cooperation in Spatial Public Goods Games via Group Relative Policy Optimization with Global Cooperation Constraint},
  author = {Zhaoqilin Yang and Chanchan Li and Tianqi Liu and Hongxin Zhao and Youliang Tian},
  year   = {2025},
  eprint = {2510.08607},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.08607v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.08607.svg)](https://codeofpaper.com/paper/2510.08607)

Discussion