Non-computable strategies and discounted repeated games

zbMATH Open0852.90146MaRDI QIDQ1920963FDOQ1920963

Authors: John H. Nachbar, William R. Zame 

Publication date: 6 August 1996

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

Recommendations

• Bounded versus unbounded rationality: The tyranny of the weak
• scientific article
• 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

zbMATH Keywords

automatonrepeated gamesbounded rationalityTuring machinediscounted repeated gamescomputable strategies

Mathematics Subject Classification ID

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

Cited In (13)

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

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)