2 research outputs found
Recommended from our members
On the inference of strategies
We investigate the use of automata theory to model strategies for nonzero-sum two-person games such as the Prisoner's Dilemma. We are particularly interested in infinite tournaments of such games. In the case of finite-state strategies (such as ALL D or TIT FOR TAT) we use graph traversal techniques to show the existence of a (non-terminating) procedure for detecting our opponent's strategy and developing an "optimal" defense. We also investigate counter machine and Turing machine strategies. We show that the optimal defense to a counter machine strategy need not be finite-state, thus disproving a previous conjecture. We show that determining an optimal defense to an arbitrary Turing machine strategy is undecidable