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.
- Informational requirements and strategic complexity in repeated games (Q1196653) (← 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)
- Evolutionary stability in alternating-offers bargaining games (Q1268576) (← links)
- Evolved perception and behaviour in oligopolies (Q1274208) (← links)
- Communication, computability, and common interest games (Q1294100) (← links)
- Forecasting errors and bounded rationality: An example (Q1296456) (← links)
- Little perfection and complexity (Q1313357) (← links)
- Bayesian boundedly rational agents play the finitely repeated prisoner's dilemma (Q1316659) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- Representing the knowledge of Turing machines (Q1330015) (← links)
- Bounded rationality, neural network and folk theorem in repeated games with discounting (Q1339026) (← links)
- Finite automata play repeated prisoner's dilemma with information processing costs (Q1350653) (← links)
- On calculating the Krohn-Rhodes decomposition of automata (Q1366274) (← links)
- On the interpretation of decision problems with imperfect recall (Q1366490) (← links)
- Evolutionarily stable strategies in the repeated prisoner's dilemma (Q1366895) (← 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)
- Computational economics and economic theory: Substitutes or complements? (Q1391659) (← links)
- Nash equilibrium when players account for the complexity of their forecasts. (Q1408712) (← links)
- Evolutionary stability and lexicographic preferences. (Q1408714) (← links)
- A computer scientist looks at game theory. (Q1413213) (← links)
- Choosing social laws for multi-agent systems: Minimality and simplicity (Q1575182) (← links)
- Uniqueness and efficiency of Nash equilibrium in a family of randomly generated repeated games. (Q1609076) (← links)
- An axiomatization of plays in repeated games (Q1651220) (← links)
- Acceptable strategy profiles in stochastic games (Q1651302) (← links)
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
- Errors can increase cooperation in finite populations (Q1691361) (← links)
- On equilibria in games with imperfect recall (Q1735741) (← links)
- Rationality and bounded information in repeated games, with application to the iterated prisoner's dilemma (Q1775816) (← links)
- Dynamics of internal models in game players (Q1808361) (← links)
- Small talk and cooperation: A note on bounded rationality (Q1823173) (← links)
- Cooperative equilibria in discounted stochastic sequential games (Q1823883) (← links)
- Dynamical systems game theory and dynamics of games (Q1841166) (← links)
- In defense of DEFECT. (Q1864806) (← links)
- Endogenous fluctuations under evolutionary pressure in Cournot competition (Q1864816) (← links)
- Bargaining and markets: Complexity and the competitive outcome (Q1876641) (← links)
- Belief-based equilibrium (Q1885429) (← links)
- Simplicity of beliefs and delay tactics in a concession game (Q1885431) (← links)
- On the complexity of repeated principal agent games (Q1906023) (← links)
- A lower bound on computational complexity given by revelation mechanisms (Q1920945) (← links)
- Leave and let leave: a sufficient condition to explain the evolutionary emergence of cooperation (Q1994622) (← links)
- 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)
