TY - JOUR
T1 - The complexity of computing best-response automata in repeated games
AU - Gilboa, Itzhak
N1 - Funding Information:
* I thank Professor David Schmeidler for the discussions which motivated and directed this research. I am also grateful to two anonymous referees for helpful comments. Financial assistance from the Josef Buchman Fund and the use of typing facilities of the Foerder Institute for Economic Research are gratefully acknowledged. 342
PY - 1988/8
Y1 - 1988/8
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38249029225&partnerID=8YFLogxK
U2 - 10.1016/0022-0531(88)90274-8
DO - 10.1016/0022-0531(88)90274-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:38249029225
SN - 0022-0531
VL - 45
SP - 342
EP - 352
JO - Journal of Economic Theory
JF - Journal of Economic Theory
IS - 2
ER -