Pages that link to "Item:Q1193752"

The following pages link to Repeated games, finite automata, and complexity (Q1193752):

Displaying 44 items.

• Bounded computational capacity equilibrium (Q281361) (← links)
• Bounded rationality, strategy simplification, and equilibrium (Q361802) (← links)
• Uncoupled automata and pure Nash equilibria (Q532750) (← links)
• Bottom-up design of strategic options as finite automata (Q601965) (← links)
• Modelling equilibrium play as governed by analogy and limited foresight (Q608549) (← links)
• The effect of noise and average relatedness between players in iterated games (Q668675) (← links)
• Finite automata play a repeated extensive game (Q688907) (← links)
• Repeated implementation and complexity considerations (Q926328) (← links)
• Adaptation and complexity in repeated games (Q926890) (← links)
• Complexity and effective prediction (Q972136) (← links)
• Perceptron versus automaton in the finitely repeated prisoner's dilemma (Q993503) (← links)
• Codification schemes and finite automata (Q1005753) (← links)
• Limitations of learning in automata-based systems (Q1046075) (← links)
• The complexity of computing best-response automata in repeated games (Q1106110) (← links)
• Finite automata equilibria with discounting (Q1183702) (← 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)
• Coalition formation under limited communication (Q1194262) (← links)
• Informational requirements and strategic complexity in repeated games (Q1196653) (← 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)
• 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)
• Finite automata play repeated prisoner's dilemma with information processing costs (Q1350653) (← links)
• Nash equilibrium when players account for the complexity of their forecasts. (Q1408712) (← links)
• Uniqueness and efficiency of Nash equilibrium in a family of randomly generated repeated games. (Q1609076) (← links)
• Errors can increase cooperation in finite populations (Q1691361) (← links)
• Repeated games with finite automata (Q1804012) (← links)
• Bargaining and markets: Complexity and the competitive outcome (Q1876641) (← links)
• Simplicity of beliefs and delay tactics in a concession game (Q1885431) (← links)
• Equilibrium payoffs in repeated two-player zero-sum games of finite automata (Q2002062) (← links)
• Zero-determinant strategies in infinitely repeated three-player prisoner's dilemma game (Q2169719) (← links)
• Modeling emotions and reason in agent-based systems (Q2267812) (← links)
• On the benefits of party competition (Q2389296) (← links)
• Strategic complexity in repeated extensive games (Q2437166) (← links)
• A strong anti-folk theorem (Q2491089) (← 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)
• (Q3172528) (← links)
• Game Theory and Strategic Complexity (Q5150304) (← links)
• The complexity of recursion theoretic games (Q5694972) (← links)
• On the complexity of forming mental models (Q6565794) (← links)