arXiv (All)
open access
Multiplayer games on regular graphs under aspiration-driven imitation: Fixation probabilities and the dilution principle
We investigate how cooperation evolves in multiplayer games on regular graphs of degree $k$ when individuals base their decisions on both their own aspiration levels and the success of their neighbors. We calculate explicit first-order formulas for fixation probabilities using pair approximation and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Game Theory#702308
- Variable Bound Tightening for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games#307049
- A minority-proof cheap-talk protocol#1277630
- Characterizing Pure-strategy Equilibria in Large Games#1277547
- The Tragedy of the Conventions#694581
Record · ID 1387742
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive