Bounded Rationality and Machine Games

Fiche du document

Auteur
Date

2005

Discipline
Type de document
Périmètre
Langue
Identifiant
Source

Revue économique

Collection

Cairn.info

Organisation

Cairn

Licence

Cairn

Sujets proches En

Amusements Children--Recreation Games for children Pastimes Primitive games Recreations Games, Primitive Children's games Pattern Model

Citer ce document

Sylvain Béal, « Bounded Rationality and Machine Games », Revue économique, ID : 10670/1.b2eb4d...

Métriques

Partage / Export

Résumé 0

We study one aspect of the rationality of players in repeated games. The central assumption is that player’s choice is limited to strategies that can be computed by a model of computation (or machine). We investigate two of such models: the finite automaton and the perceptron. Each model of computation gives its own abilities to the player that uses it. We consider several possible measures for the complexity of a machine. We survey in this article the most important results on the complexity of strategies for the class of machine games.Classification JEL: C72

document thumbnail

Par les mêmes auteurs

Sur les mêmes sujets

Sur les mêmes disciplines