论文信息 - The complexity of computing a best response automaton in repeated games with mixed strategies - 字舞流文

The complexity of computing a best response automaton in repeated games with mixed strategies

Elchanan Ben-Porath

[1] T. Tan,et al. The Bayesian foundations of solution concepts of games , 1988 .

[2] I. Gilboa. The Complexity of Computing Best-Response Automata in Repeated Games , 1988 .

[3] Adam Brandenburger,et al. Rationalizability and Correlated Equilibria , 1987 .

[4] A. Rubinstein. Finite automata play the repeated prisoner's dilemma , 1986 .

[5] David Pearce. Rationalizable Strategic Behavior and the Problem of Perfection , 1984 .

[6] B. Bernheim. Rationalizable Strategic Behavior , 1984 .

[7] R. Aumann. Subjectivity and Correlation in Randomized Strategies , 1974 .

[8] R. Aumann. Correlated Equilibrium as an Expression of Bayesian Rationality Author ( s ) , 1987 .

[9] A. Neyman. Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .

[10] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[11] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .