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.
Domaines
Economie et sciences de la décision
Loading...