Computable strategies for repeated prisoner's dilemma

DOI10.1006/game.1994.1057zbMath0819.90138OpenAlexW2087974695MaRDI QIDQ1342402

Vicki Knoblauch

Publication date: 5 September 1995

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/game.1994.1057

zbMATH Keywords

computable strategyundiscounted, infinitely repeated prisoner's dilemma

Mathematics Subject Classification ID

Multistage and repeated games (91A20)

Related Items

A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff, New complexity results about Nash equilibria, A station strategy to deter backoff attacks in IEEE 802.11 LANs, Model-based learning of interaction strategies in multi-agent systems