Complexity and effective prediction

DOI10.1016/J.GEB.2009.05.007zbMATH Open1229.91059OpenAlexW2160305771MaRDI QIDQ972136FDOQ972136

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

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

Mathematics Subject Classification ID

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

Cites Work

• Repeated games with finite automata
• Finitely repeated games with finite automata
• Title not available (Why is that?)
• Two-person repeated games with finite automata

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of interacting automata
• 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
• Title not available (Why is that?)

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)