scientific article; zbMATH DE number 1054720
From MaRDI portal
Publication:4352265
Recommendations
Cited in
(21)- On finite strategy sets for finitely repeated zero-sum games.
- The complexity of interacting automata
- On the Complexity of Coordination
- Bounded computational capacity equilibrium
- Growth of strategy sets, entropy, and nonstationary bounded recall
- Complexity and effective prediction
- Should I remember more than you? Best responses to factored strategies
- Codification schemes and finite automata
- Strategic entropy and complexity in repeated games
- Signal decoding with help of finite automata: application to games with incomplete information
- Repeated games with bounded entropy
- Two-person repeated games with finite automata
- Online concealed correlation and bounded rationality
- Edgar Allan Poe's riddle: framing effects in repeated matching pennies games
- Coordination through de Bruijn sequences
- Games with Symmetric Incomplete Information and Asymmetric Computational Resources
- Bounded rationality, strategy simplification, and equilibrium
- Game theory and strategic complexity
- On the impact of player capability on congestion games
- Computer science and decision theory
- Limits of correlation in repeated games with bounded memory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352265)
