Cooperation and Effective Computability

DOI10.2307/2171773zbMath0841.90129OpenAlexW1529718773MaRDI QIDQ4859516

Hamid Sabourian, Luca Anderlini

Publication date: 7 January 1996

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2171773

zbMATH Keywords

perturbationscommon interest gamesupergame strategiesundiscounted repeated game

Mathematics Subject Classification ID

Cooperative games (91A12) Multistage and repeated games (91A20)

Related Items (13)

Bounded memory folk theorem ⋮ Satisficing leads to cooperation in mutual interests games ⋮ Probabilistic representation of complexity. ⋮ The Gödelian Foundations of Self-Reference,the Liar and Incompleteness: Arms Racein Complex Strategic Innovation ⋮ Game Theory and Strategic Complexity ⋮ Consistency and cautious fictitious play ⋮ Introduction to computer science and economic theory ⋮ Computability of simple games: A characterization and application to the core ⋮ Cooperation and computability in \(n\)-player games ⋮ Computer science and decision theory ⋮ Communication, computability, and common interest games ⋮ Forecasting errors and bounded rationality: An example ⋮ Unpredictability of complex (pure) strategies

This page was built for publication: Cooperation and Effective Computability