Pages that link to "Item:Q1084866"
From MaRDI portal
The following pages link to Finite automata play the repeated prisoner's dilemma (Q1084866):
Displaying 50 items.
- Bounded computational capacity equilibrium (Q281361) (← links)
- Bounded rationality, strategy simplification, and equilibrium (Q361802) (← links)
- Bounded memory and permanent reputations (Q392656) (← links)
- Cooperative strategies in anonymous economies: an experiment (Q423725) (← links)
- How burning money requires a lot of rationality to be effective (Q433732) (← links)
- Symmetric play in repeated allocation games (Q472178) (← links)
- Learning with bounded memory in games (Q485768) (← links)
- Towards a theory of game-based non-equilibrium control systems (Q488883) (← links)
- Agility in repeated games: an example (Q500583) (← links)
- Choice and complexity (Q581191) (← links)
- Bottom-up design of strategic options as finite automata (Q601965) (← links)
- Modelling equilibrium play as governed by analogy and limited foresight (Q608549) (← links)
- Fault-tolerant strategies in the iterated prisoner's dilemma (Q656583) (← links)
- Finitely repeated prisoners' dilemma experiments without a commonly known end (Q662273) (← links)
- Behavioral spillovers and cognitive load in multiple games: an experimental study (Q665075) (← links)
- The effect of noise and average relatedness between players in iterated games (Q668675) (← links)
- Computing equilibria in discounted dynamic games (Q668745) (← links)
- Induction and the Ramsey policy (Q673696) (← links)
- Program equilibrium (Q705874) (← links)
- Cooperation and bounded recall (Q804483) (← links)
- Cognitive rationality and alternative belief measures (Q807474) (← links)
- On the optimality of monetary trading (Q825167) (← links)
- A simple model of secure public communication (Q836045) (← links)
- In and out of equilibrium. I: Evolution of strategies in repeated games with discounting. (Q899680) (← links)
- Finite rationalizability and cooperation in the finitely repeated prisoners' dilemma (Q899922) (← 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)
- Repeated implementation and complexity considerations (Q926328) (← links)
- Adaptation and complexity in repeated games (Q926890) (← 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)
- Coase theorem, complexity and transaction costs (Q996376) (← links)
- Limitations of learning in automata-based systems (Q1046075) (← links)
- The complexity of computing best-response automata in repeated games (Q1106110) (← links)
- Repeated games with stationary bounded recall strategies (Q1108212) (← links)
- Cycles in extensive form perfect information games (Q1176957) (← links)
- Computability and randomness of Nash equilibrium in infinite games (Q1177225) (← links)
- Finite automata equilibria with discounting (Q1183702) (← links)
- Imperfect equilibrium (Q1187862) (← links)
- The strength of a little perfection (Q1189667) (← links)
- Information leakage forces cooperation (Q1191825) (← links)
- Repeated games, finite automata, and complexity (Q1193752) (← links)
- Computation as a correlation device (Q1193755) (← links)
- The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774) (← links)
- Coalition formation under limited communication (Q1194262) (← links)
- Optimal pricing against a simple learning rule (Q1195592) (← links)
- Equilibrium of repeated games with cost of implementation (Q1196196) (← links)
- Approximations of cooperative equilibria in multi-person prisoners' dilemma played by cellular automata (Q1196271) (← links)
- Predicting the effects of intervention and sabotage in a bounded complex game (Q1196273) (← links)
