Non-computable strategies and discounted repeated games

MaRDI QIDQ1920963zbMATH OpenFDO

Authors John H. Nachbar, William R. Zame

Publication date 6 August 1996

Published in Economic Theory (Search for Journal in Brave)

zbMATH Keywords

automatonrepeated gamesbounded rationalityTuring machinediscounted repeated gamescomputable strategies

Mathematics Subject Classification ID

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

Recommendations

• Bounded versus unbounded rationality: The tyranny of the weak
• scientific article; zbMATH DE number 4202070
• On complexity as bounded rationality (extended abstract)
• The complexity of computing a best response automaton in repeated games with mixed strategies
• Two-person repeated games with finite automata

Cited in

(13)

• Equilibrium paths in discounted supergames
• A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff
• Verified methods for computing Pareto sets: general algorithmic analysis
• Testing randomness by Matching Pennies
• Optimality and domination in repeated games with bounded players
• Competitive equilibrium with intuitionistic agents
• Some notes on Church's thesis and the theory of games
• Excludability and Bounded Computational Capacity
• scientific article; zbMATH DE number 592681 (Why is no real title available?)
• Computable preference and utility
• The Gödelian foundations of self-reference, the liar and incompleteness: arms race in complex strategic innovation
• New complexity results about Nash equilibria
• scientific article; zbMATH DE number 3887475 (Why is no real title available?)

This page was built for publication: Non-computable strategies and discounted repeated games

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