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.
(This abstract was borrowed from another version of this item.)
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:45:y:1988:i:2:p:342-352. 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: (Dana Niculescu)
If references are entirely missing, you can add them using this form.