Munich Personal RePEc Archive
metadata only
Preference-based Cooperation in a Prisoner's Dilemma Game: Whole Population Cooperation without Information Flow across Matches
This paper studies the possibility of cooperation based on players' preferences. Consider the following infinitely repeated game, similar to Ghosh and Ray (1996). At each stage, uncountable numbers of players are randomly matched without information about their partners' past actions and play a pris
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
- Preference-based Cooperation in a Prisoner's Dilemma Game#1276739
- Reframing the Prisoner's Dilemma: A Comparative Analysis of Classical Game Theory and Universal Laws of Cooperation#726123
- Bargaining Set Solution Concepts in Dynamic Cooperative Games#1278246
- Overcoming unfairness via repeated interactions in mini-ultimatum game#1341381
- Equilibrium Play Without Mutual Knowledge of Rationality#1144849
Record · ID 1276045
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