Cooperation and Effective Computability

DOI10.2307/2171773MaRDI QIDQ4859516zbMATH OpenOpenAlexFDO

Authors Luca Anderlini, Hamid Sabourian

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

common interest gameperturbationssupergame strategiesundiscounted repeated game

Mathematics Subject Classification ID

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

Recommendations

• Cooperation and computability in \(n\)-player games
• Communication, computability, and common interest games
• Cooperation and Punishment
• On complexity as bounded rationality (extended abstract)
• Cooperation in Repeated Games When the Number of Stages is not Commonly Known

Cited in

(17)

• Communication, computability, and common interest games
• Forecasting errors and bounded rationality: An example
• Satisficing leads to cooperation in mutual interests games
• Probabilistic representation of complexity.
• Introduction to computer science and economic theory
• Computer science and decision theory
• Unpredictability of complex (pure) strategies
• Computability of simple games: A characterization and application to the core
• Bounded memory folk theorem
• scientific article; zbMATH DE number 4047161 (Why is no real title available?)
• Cooperation and Punishment
• The Gödelian foundations of self-reference, the liar and incompleteness: arms race in complex strategic innovation
• Game theory and strategic complexity
• Computation, cooperation, and life. Essays dedicated to Gheorghe Păun on the occasion of his 60th birthday
• Cooperation and computability in \(n\)-player games
• Consistency and cautious fictitious play
• Infinite horizon common interest games with perfect information

This page was built for publication: Cooperation and Effective Computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859516)