The Complexity of Computing Best-Response Automata in Repeated Games
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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1988|
|Publication status:||Published in Journal of Economic Theory, Elsevier, 1988, vol. 45, pp. 342-352. <10.1016/0022-0531(88)90274-8>|
|Note:||View the original document on HAL open archive server: https://hal-hec.archives-ouvertes.fr/hal-00756286|
|Contact details of provider:|| Web page: https://hal.archives-ouvertes.fr/|
When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-00756286. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD)
If references are entirely missing, you can add them using this form.