Complexity and effective prediction

DOI10.1016/J.GEB.2009.05.007MaRDI QIDQ972136zbMATH OpenOpenAlexFDO

Authors Abraham Neyman, Joel Spencer

Publication date 25 May 2010

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

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

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Recommendations

• Two-person repeated games with finite automata
• The complexity of interacting automata
• Repeated games with finite automata
• scientific article; zbMATH DE number 4202070
• Repeated games, finite automata, and complexity

Cites work

• scientific article; zbMATH DE number 1054720 (Why is no real title available?)
• Finitely repeated games with finite automata
• Repeated games with finite automata
• Two-person repeated games with finite automata

Cited in

(9)

• scientific article; zbMATH DE number 4088928 (Why is no real title available?)
• The complexity of interacting automata
• scientific article; zbMATH DE number 5008434 (Why is no real title available?)
• Correlation through bounded recall strategies
• Algorithmic complexity bounds on future prediction errors
• Predicting the effects of intervention and sabotage in a bounded complex game
• QUANTIFYING PREDICTABILITY IN A SIMPLE MODEL WITH COMPLEX FEATURES
• Unpredictability of complex (pure) strategies
• scientific article; zbMATH DE number 3921627 (Why is no real title available?)

This page was built for publication: Complexity and effective prediction

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