Pages that link to "Item:Q1804012"
From MaRDI portal
The following pages link to Repeated games with finite automata (Q1804012):
Displaying 35 items.
- The complexity of interacting automata (Q267110) (← links)
- Bounded computational capacity equilibrium (Q281361) (← links)
- Bounded rationality, strategy simplification, and equilibrium (Q361802) (← links)
- Correlation through bounded recall strategies (Q378336) (← links)
- Edgar Allan Poe's riddle: framing effects in repeated matching pennies games (Q625037) (← links)
- Finite automata play a repeated extensive game (Q688907) (← links)
- Playing off-line games with bounded rationality (Q943583) (← links)
- Complexity and effective prediction (Q972136) (← links)
- Codification schemes and finite automata (Q1005753) (← links)
- Growth of strategy sets, entropy, and nonstationary bounded recall (Q1021606) (← links)
- On players with a bounded number of states (Q1187868) (← links)
- Repeated games, finite automata, and complexity (Q1193752) (← links)
- Nash equilibrium strategies in repeated games with and without cost of implementation (Q1200774) (← links)
- Finite automata play repeated prisoner's dilemma with information processing costs (Q1350653) (← links)
- Rationality and bounded rationality (Q1378010) (← links)
- On finite strategy sets for finitely repeated zero-sum games. (Q1399527) (← links)
- The evolution of rationality and the Red Queen. (Q1400982) (← links)
- Two-person repeated games with finite automata (Q1423665) (← links)
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
- Rationality and bounded information in repeated games, with application to the iterated prisoner's dilemma (Q1775816) (← links)
- Strategic entropy and complexity in repeated games (Q1818294) (← links)
- Repeated games with bounded entropy (Q1973449) (← links)
- Equilibrium payoffs in repeated two-player zero-sum games of finite automata (Q2002062) (← links)
- Should I remember more than you? Best responses to factored strategies (Q2021813) (← links)
- Unpredictability of complex (pure) strategies (Q2345202) (← links)
- Online concealed correlation and bounded rationality (Q2345207) (← links)
- Plausible cooperation (Q2347768) (← links)
- Limits of correlation in repeated games with bounded memory (Q2416639) (← links)
- Directed graphical structure, Nash equilibrium, and potential games (Q2417148) (← links)
- Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game (Q2698082) (← links)
- Finitely repeated games with finite automata (Q2757548) (← links)
- Finitely Repeated Games (Q3716856) (← links)
- Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games (Q4593826) (← links)
- Game Theory and Strategic Complexity (Q5150304) (← links)
- Learning with limited memory: Bayesianism vs heuristics (Q6105380) (← links)
