Pages that link to "Item:Q1084866"
From MaRDI portal
The following pages link to Finite automata play the repeated prisoner's dilemma (Q1084866):
Displaying 48 items.
- Equilibrium payoffs in repeated two-player zero-sum games of finite automata (Q2002062) (← links)
- Efficient communication and indexicality (Q2019332) (← links)
- Should I remember more than you? Best responses to factored strategies (Q2021813) (← links)
- On composition of bounded-recall plans (Q2046034) (← links)
- The weirdness theorem and the origin of quantum paradoxes (Q2062465) (← links)
- Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations (Q2065768) (← links)
- Controlling conditional expectations by zero-determinant strategies (Q2079287) (← links)
- Conditions that enable a player to surely win in sequential quantum games (Q2101555) (← links)
- Cooperation between emotional players (Q2223649) (← links)
- Stable sampling in repeated games (Q2231424) (← links)
- Imperfect recall and time inconsistencies: an experimental test of the absentminded driver ``paradox'' (Q2248907) (← links)
- Incentive constraints in games with bounded memory (Q2248909) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Algorithmic rationality: game theory with costly computation (Q2253839) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447) (← links)
- Online concealed correlation and bounded rationality (Q2345207) (← links)
- Plausible cooperation (Q2347768) (← links)
- Bounded rationality and repeated network formation (Q2381460) (← links)
- Analogy-based expectation equilibrium (Q2386131) (← links)
- Approachability with bounded memory (Q2389319) (← links)
- The robustness of zero-determinant strategies in iterated prisoner's dilemma games (Q2415596) (← links)
- In and out of equilibrium. II: Evolution in repeated games with discounting and complexity costs (Q2416638) (← links)
- Limits of correlation in repeated games with bounded memory (Q2416639) (← links)
- Strategic complexity in repeated extensive games (Q2437166) (← links)
- The role of information processing cost as the foundation of bounded rationality in game theory (Q2442560) (← links)
- The value of (bounded) memory in a changing world (Q2447166) (← links)
- Stationary strategies in iterated prisoner's dilemma (Q2458128) (← links)
- A strong anti-folk theorem (Q2491089) (← links)
- Introduction to learning and bounded rationality. (Preface to the special issue.) (Q2577519) (← links)
- Nonlocal correlations and noise in different settings of a two-player game (Q2677603) (← links)
- Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game (Q2698082) (← links)
- Complexity of games and bounded rationality (Q3202087) (← links)
- Spatial games and the maintenance of cooperation. (Q4300652) (← links)
- Model-based learning of interaction strategies in multi-agent systems (Q4421289) (← links)
- Games with Symmetric Incomplete Information and Asymmetric Computational Resources (Q4567820) (← links)
- Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games (Q4593826) (← links)
- ON THE SURVIVAL OF COOPERATION UNDER DIFFERENT MATCHING SCHEMES (Q4808013) (← links)
- Game Theory and Strategic Complexity (Q5150304) (← links)
- Repeated Sequential Prisoner's Dilemma: The Stackleberg Variant (Q5245844) (← links)
- Problem solving by heterogeneous agents (Q5937319) (← links)
- Analogies, adaptation, and anomalies (Q5938049) (← links)
- Cooperation and computability in \(n\)-player games (Q5946255) (← links)
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)
- Forgetful updating and stubborn decision-makers (Q6107379) (← links)
- On the impact of player capability on congestion games (Q6109527) (← links)
- Quantum Tapsilou -- a quantum game inspired by the traditional Greek coin tossing game Tapsilou (Q6555661) (← links)
- On the complexity of forming mental models (Q6565794) (← links)
