The Complexity of Computing Best-Response Automata in Repeated Games - HAL Accéder directement au contenu
Article dans une revue Journal of Economic Theory Année : 1988

The Complexity of Computing Best-Response Automata in Repeated Games

Résumé

The following problem is examined: given a game and the opponents' finite automata, find a best-response automaton for a certain player in the repeated game. It is shown that the problem is relatively "easy" (i.e., of polynomial time complexity) if the number of players is fixed, but "difficult" otherwise.
Loading...

Dates et versions

hal-00756286, version 1 (22-11-2012)

Identifiants

Citer

Itzhak Gilboa. The Complexity of Computing Best-Response Automata in Repeated Games. Journal of Economic Theory, 1988, vol. 45, pp. 342-352. ⟨10.1016/0022-0531(88)90274-8⟩. ⟨hal-00756286⟩

Collections

HEC
97 Consultations
0 Téléchargements
Dernière date de mise à jour le 20/04/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus