Efficient algorithms for learning to play repeated games against computationally bounded adversaries
暂无分享,去创建一个
Ronitt Rubinfeld | Dana Ron | Yishay Mansour | Yoav Freund | Robert E. Schapire | Michael Kearns | Y. Mansour | Y. Freund | R. Schapire | M. Kearns | D. Ron | R. Rubinfeld
[1] Leslie Pack Kaelbling,et al. Inferring finite automata with stochastic output functions and an application to map learning , 1992, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[2] A. Neyman. Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .
[3] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[4] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5] E. Kalai. Bounded Rationality and Strategic Complexity in Repeated Games , 1987 .
[6] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[7] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.
[8] Itzhak Gilboa,et al. Bounded Versus Unbounded Rationality: The Tyranny of the Weak , 1989 .
[9] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[10] Ronitt Rubinfeld,et al. Learning fallible finite state automata , 1993, COLT '93.
[11] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.
[12] Mihalis Yannakakis,et al. On complexity as bounded rationality (extended abstract) , 1994, STOC '94.
[13] Lance Fortnow,et al. Optimality and domination in repeated games with bounded players , 1993, STOC '94.
[14] Vladimir Vovk,et al. An optimal-control application of two paradigms of on-line learning , 1994, COLT '94.
[15] Ronitt Rubinfeld,et al. Exactly learning automata with small cover time , 1995, COLT '95.