Non-computable strategies and discounted repeated games

zbMath0852.90146MaRDI QIDQ1920963

John H. Nachbar, William R. Zame

Publication date: 6 August 1996

Published in: Economic Theory (Search for Journal in Brave)

zbMATH Keywords

repeated gamesTuring machinebounded rationalityautomatondiscounted repeated gamescomputable strategies

Mathematics Subject Classification ID

Multistage and repeated games (91A20) Turing machines and related notions (03D10)

Related Items

Verified Methods for Computing Pareto Sets: General Algorithmic Analysis ⋮ A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ Competitive equilibrium with intuitionistic agents ⋮ The Gödelian Foundations of Self-Reference,the Liar and Incompleteness: Arms Racein Complex Strategic Innovation ⋮ Computable preference and utility ⋮ New complexity results about Nash equilibria ⋮ Equilibrium paths in discounted supergames