How aspiration and neighbors influence cooperation in games

Researchers studied how individuals make decisions based on their own aspirations and the success of neighbors in multiplayer games.

Researchers investigated how cooperation evolves in multiplayer games on regular graphs of degree kk. Individuals base decisions on aspiration levels and the success of neighbors.

The study used pair approximation and diffusion methods under weak selection to calculate explicit first-order formulas for fixation probabilities. These formulas separate aspiration effects from payoff effects filtered by the graph.

Increasing the graph degree attenuates selection effects driven by payoffs. The contribution of the aspiration gap Δα=αD−αC\Delta\alpha=\alpha_D-\alpha_C is independent of graph degree at first order.

The framework was applied to public goods, stag-hunt, and snowdrift games. In public goods and stag-hunt games, cooperation requires a sufficiently positive aspiration gap to compensate for the cost of contributing.

In the snowdrift game, benefit and cost contributions vanish in the locally tree-like regime at large degree. This leaves the aspiration gap as the leading first-order contribution.

Monte Carlo simulations on connected random regular graphs of degree kk were consistent with the first-order predictions. Simulations outside this regime are interpreted only as qualitative checks of the predicted trends.

Key facts

  • Increasing graph degree attenuates selection effects driven by payoffs.
  • The aspiration gap Δα=αD−αC\Delta\alpha=\alpha_D-\alpha_C is independent of graph degree at first order.
  • In snowdrift games, the aspiration gap is the leading first-order contribution at large degree.

All sections

Edition