Unpredictability of complex (pure) strategies

DOI10.1016/j.geb.2014.08.002zbMath1318.03048OpenAlexW2031061725MaRDI QIDQ2345202

Tai-Wei Hu

Publication date: 19 May 2015

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2014.08.002

zbMATH Keywords

Kolmogorov complexityzero-sum gamealgorithmic randomnessmixed strategyobjective probabilityfrequency theory of probability

Mathematics Subject Classification ID

2-person games (91A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Multistage and repeated games (91A20) Algorithmic randomness and dimension (03D32)

Related Items (1)

How to gamble against all odds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Repeated games with stationary bounded recall strategies
• On players with a bounded number of states
• Classical recursion theory. Vol. II
• Rationality and bounded rationality
• Repeated games with finite automata
• How to play with a biased coin?
• Repeated games with bounded entropy
• Expected utility theory from the frequentist perspective
• Finitely Repeated Games with Finite Automata
• Professionals Play Minimax
• Algorithmic Randomness and Complexity
• Calibrating Randomness
• A Theory of Program Size Formally Identical to Information Theory
• Expressible inspections
• Cooperation and Effective Computability
• A unified approach to the definition of random sequences

This page was built for publication: Unpredictability of complex (pure) strategies