Pages that link to "Item:Q373811"
From MaRDI portal
The following pages link to Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma (Q373811):
Displayed 50 items.
- Modelling equilibrium play as governed by analogy and limited foresight (Q608549) (← links)
- Program equilibrium (Q705874) (← links)
- Cooperation and bounded recall (Q804483) (← links)
- Finite complexity and the folk theorem in repeated games (Q811424) (← links)
- Some notes on Church's thesis and the theory of games (Q911776) (← links)
- On the non-existence of a rationality definition for extensive games (Q920856) (← links)
- Playing off-line games with bounded rationality (Q943583) (← links)
- Building up social capital in a changing world (Q959676) (← links)
- Perceptron versus automaton in the finitely repeated prisoner's dilemma (Q993503) (← links)
- Codification schemes and finite automata (Q1005753) (← links)
- Growth of strategy sets, entropy, and nonstationary bounded recall (Q1021606) (← links)
- Repeated games with stationary bounded recall strategies (Q1108212) (← links)
- Imperfect equilibrium (Q1187862) (← links)
- On players with a bounded number of states (Q1187868) (← links)
- The strength of a little perfection (Q1189667) (← links)
- Repeated games, finite automata, and complexity (Q1193752) (← links)
- The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774) (← links)
- Equilibrium of repeated games with cost of implementation (Q1196196) (← links)
- Predicting the effects of intervention and sabotage in a bounded complex game (Q1196273) (← links)
- Bounded versus unbounded rationality: The tyranny of the weak (Q1198164) (← links)
- Nash equilibrium strategies in repeated games with and without cost of implementation (Q1200774) (← links)
- Evolutionary stability in repeated games played by finite automata (Q1201139) (← links)
- Evolved perception and behaviour in oligopolies (Q1274208) (← links)
- Repeated implementation (Q1277094) (← links)
- Communication, computability, and common interest games (Q1294100) (← links)
- Forecasting errors and bounded rationality: An example (Q1296456) (← links)
- Distributed games (Q1300674) (← links)
- Bayesian boundedly rational agents play the finitely repeated prisoner's dilemma (Q1316659) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- Finite automata play repeated prisoner's dilemma with information processing costs (Q1350653) (← links)
- Satisficing leads to cooperation in mutual interests games (Q1376985) (← links)
- Rationality and bounded rationality (Q1378010) (← links)
- Learning to play limited forecast equilibria (Q1384018) (← links)
- A computer scientist looks at game theory. (Q1413213) (← links)
- Rationality and bounded information in repeated games, with application to the iterated prisoner's dilemma (Q1775816) (← links)
- Cooperation in an one-shot prisoners' dilemma (Q1804642) (← links)
- Strategic entropy and complexity in repeated games (Q1818294) (← links)
- Small talk and cooperation: A note on bounded rationality (Q1823173) (← links)
- Dynamical systems game theory and dynamics of games (Q1841166) (← links)
- Belief-based equilibrium (Q1885429) (← links)
- A lower bound on computational complexity given by revelation mechanisms (Q1920945) (← links)
- Repeated games with bounded entropy (Q1973449) (← links)
- The instability of instability of centered distributions (Q2270335) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Bounded rationality and repeated network formation (Q2381460) (← links)
- A general criterion and an algorithmic framework for learning in multi-agent systems (Q2384145) (← links)
- Analogy-based expectation equilibrium (Q2386131) (← links)
- Approachability with bounded memory (Q2389319) (← links)
- Complexity of games and bounded rationality (Q3202087) (← links)
- Pareto efficiency, simple game stability, and social structure in finitely repeated games (Q5691279) (← links)