On the inference of strategies (Q1263988)

Some methods of automata theory are used to nonzero-sum two-person games. The infinite tournaments of such games are investigated. In the case of finite-state strategies the author uses graph traversal techniques to detecting opponent's strategy and developing an optimal defense. The author shows that the optimal defense to a counter machine strategy need to be finite-state, and that determining an optimal defense to an arbitrary Turing machine strategy is undecidable.