Edge Games: Cooperative Partner Selection in Network Cooperation Evolution

TL;DR

This paper introduces the 'edge game' model, where edges in complex networks act as virtual players to study cooperation, revealing conditions for stable cooperation and advantages over existing algorithms.

Contribution

The paper proposes a novel 'edge game' model that exchanges roles of nodes and edges, providing new insights into cooperation dynamics in complex networks.

Findings

Stable cooperation achieved when synergy factor r > maximum node degree kmax.

In nearest-neighbor networks, moderate cooperation occurs when k < r < 2k.

Edge games outperform other algorithms in efficiency and scalability.

Abstract

The phenomenon of group cooperation constitutes a fundamental mechanism underlying various social and biological systems. Complex networks provide a structural framework for group interactions, where individuals can not only obtain information from their neighbors but also choose neighbors as cooperative partners. However, traditional evolutionary game theory models, where nodes are the game players, are not convenient for directly choosing cooperative partners. Here, we exchange the roles of nodes and edges and innovatively propose the "edge game" model, using edges in complex networks as virtual game players for group games. Theoretical analysis and simulation experiments show that by configuring a synergy factor (r) that satisfies the "moderate cooperation" condition, a stable cooperative structure can be achieved for any network at the evolutionary equilibrium. Specifically, when there is no constraint on the number of cooperators per node, the condition for the evolution of cooperation in the network is r > kmax, where kmax is the maximum degree of the nodes. When there is a threshold constraint, in nearest-neighbor coupled networks (with degree k), the condition for "moderate cooperation" is k < r < 2k. In heterogeneous networks, a variable synergy factor scheme is adopted, where the synergy factor for each game group (rx) is defined to be proportional to the degree of the central node (kx) in the group (rx = n-fold*kx), "moderate cooperation" can be achieved when 1 < n-fold < 2. If the value of r exceeds the range, it may lead to "excessive cooperation" with node overload. Comparing algorithm performance and time complexity, edge games demonstrate advantages over other optimization algorithms. Simple and universal, the edge game provides a new approach to addressing multi-agent cooperation problems in the era of machine intelligence.