DOIAbstract
Prisoner’s dilemma, Finitely repeated games, Machine games, Automaton, Perceptron, Bounded complexity, Information processing,
Prisoner’s dilemma, Finitely repeated games, Machine games, Automaton, Perceptron, Bounded complexity, Information processing,
<p>Each automaton defines a different strategy for how a player behaves during the game. If a player...
A model of learning and adaptation is used to analyze the coevolution of strategies in the repeated ...
We study two-person repeated games in which a player with a restricted set of strategies plays again...
We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing st...
This paper studies a two-player machine (finite automaton) game in which an extensive game with perf...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Localisation, Repeated prisoner's dilemma, Cellular automata, Genetic algorithm,
This paper examines the integration of computational complexity into game theoretic models. The exam...
Errors are common in strategic situations. We use a genetic algorithm to simulate the evolution of e...
The main contribution of this paper is to present a new procedure to reach cooperation through pseud...
This paper studies the repeated Prisoner’s Dilemma in a local interaction setup. We construct a sequ...
The study of strategic interaction among a society of agents is often handled using the machinery of...
Finite complexity strategies suffice for approximating all subgame perfect equ ilibrium payoffs of r...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
The paper examines the asymptotic behavior of the set of equilibrium payoffs in a repeated game when...
<p>Each automaton defines a different strategy for how a player behaves during the game. If a player...
A model of learning and adaptation is used to analyze the coevolution of strategies in the repeated ...
We study two-person repeated games in which a player with a restricted set of strategies plays again...
We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing st...
This paper studies a two-player machine (finite automaton) game in which an extensive game with perf...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Localisation, Repeated prisoner's dilemma, Cellular automata, Genetic algorithm,
This paper examines the integration of computational complexity into game theoretic models. The exam...
Errors are common in strategic situations. We use a genetic algorithm to simulate the evolution of e...
The main contribution of this paper is to present a new procedure to reach cooperation through pseud...
This paper studies the repeated Prisoner’s Dilemma in a local interaction setup. We construct a sequ...
The study of strategic interaction among a society of agents is often handled using the machinery of...
Finite complexity strategies suffice for approximating all subgame perfect equ ilibrium payoffs of r...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
The paper examines the asymptotic behavior of the set of equilibrium payoffs in a repeated game when...
<p>Each automaton defines a different strategy for how a player behaves during the game. If a player...
A model of learning and adaptation is used to analyze the coevolution of strategies in the repeated ...
We study two-person repeated games in which a player with a restricted set of strategies plays again...
Add to ORKG