Yoav Freund et al.  Home/Search
Context Related
| att.com/~schapire/...dKeMaRoRuSc95.ps.Z eng.tau.ac.il/~dan...gamesfocs95.ps.gz belllabs.com/orgs...dKeMaRoRuSc95.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: att.com/~yoav/publications (more) From: eng.tau.ac.il/~danar/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, games are played by two players. One will be called the adversary and the other the strategy learning algorithm. We think of the adversary as a fixed resource-bounded computational mechanism that may be playing a strategy quite different from the minimax optimal strategy for the game. The strategy learning algorithm will be a polynomial-time algorithm attempting to learn, from repeated plays, a profitable strategy for playing against the adversary. As is typical, a game in our... (Update)
Context of citations to this paper: More
.... design ( 4] provides an overview) or data driven adaptation of learning algorithms (especially in work on game learning, cf. e.g. [5]) is employed to yield the desired behaviour. In our work, we followed a different approach. We investigated the possibilities of...
Cited by: More
Multiagent Learning for Open Systems: A Study in Opponent.. - Rovatsos, Weiß, Wolf (2003) (Correct)
The Power of a Pebble: Exploring and Mapping Directed.. - Bender.. (1998) (Correct)
Hierarchical Common-Sense Interaction Learning - Rovatsos, Lind (2000) (Correct)
Similar documents (at the sentence level):
22.1%: Efficient Algorithms for Learning to Play Repeated .. - Freund, Kearns.. (1996) (Correct)
Active bibliography (related documents): More All
0.3: Exploration Strategies for Model-based Learning in.. - Carmel, Markovitch (1997) (Correct)
0.3: Complexity Results about Nash Equilibria - Conitzer, Sandholm (2002) (Correct)
0.2: Model-based Learning of Interaction Strategies in.. - Carmel, Markovitch (1997) (Correct)
Similar documents based on text: More All
0.2: Relative Loss Bounds for Entropy Based Updates (Preliminary.. - Herbater (Correct)
0.2: Efficient Learning of Typical Finite Automata from .. - Freund, Kearns.. (1996) (Correct)
0.2: Automata Learning and its Applications - Ron (1995) (Correct)
Related documents from co-citation: More All
7: Inference of finite automata using homing sequences (context) - Rivest, Schapire - 1993
7: Efficient learning of typical finite automata from random walks - Freund, Kearns et al. - 1993
5: The Evolution of Cooperation (context) - Axelrod - 1984
BibTeX entry: (Update)
Y. Freund, M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, and R. Schapire. Efficient algorithms for learning to play repeated games against computationally bounded adversaries. In Proceedings of the Thirty Seventh Annual Symposium on Foundations of Computer Science, pages 332--341, 1996. http://citeseer.ist.psu.edu/article/freund95efficient.html More
@inproceedings{ freund95efficient,
author = "Yoav Freund and Michael J. Kearns and Yishay Mansour and Dana Ron and Ronitt Rubinfeld and Robert E. Schapire",
title = "Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "332-341",
year = "1995",
url = "citeseer.ist.psu.edu/article/freund95efficient.html" }
Citations (may not include all citations):109 Inference of finite automata using homing sequences (context) - Rivest, Schapire - 1993
84 Learning when irrelevant attributes abound: A new linear-thr.. (context) - Littlestone - 1988
46 Inferring finite automata with stochastic output functions a.. - Dean, Angluin et al. - 1995
29 The complexity of Markov decision processes (context) - Papadimitriou, Tsitsiklis - 1987
13 Bounded complexity justifies cooperation in the finitely rep.. (context) - Neyman - 1985
13 Bounded rationality and strategic complexity in repeated gam.. (context) - Kalai - 1990
12 Bounded versus unbounded rationality: The tyranny of the wea.. (context) - Gilboa, Samet - 1989
11 Learning fallible finite state automata (context) - Ron, Rubinfeld - 1995
6 Exactly learning automata with small cover time - Ron, Rubinfeld - 1995
5 On complexity as bounded rationality (context) - Papadimitriou, Yannakakis - 1994
1 An optimal-control application of two paradigms of on-line l.. (context) - Vovk - 1994
1 Optimality anddomination in repeated games with boundedplaye.. (context) - DukeWhang - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~yoav/publications.html): More
Unsupervised Learning of Distributions on Binary Vectors.. - Freund, Haussler (1994) (Correct)
Boosting First-Order Learning - Quinlan (1996) (Correct)
How to Use Expert Advice - Cesa-Bianchi, Freund, Haussler.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC