D. Blackwell "An analog of the minimax theorem for vector payo#s," Pacific J. Math., 6, 1, pp. 1-8, 1956. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Steering Approach for Multi-Criteria Reinforcement Learning - Mannor, Shimkin (2001) (Correct)
....may a#ect both the state transition and the obtained rewards. This agent is free to choose its actions according to any control policy, and no prior assumptions are made regarding its policy. This problem formulation is derived from the so called theory of approachability that was introduced in [3] in the context of repeated matrix games with vector payo#s. Using a geometric viewpoint, it characterizes the sets in the reward space that a player can guarantee for himself for any possible policy of the other player, and provides appropriate policies for approaching these sets. Approachability ....
D. Blackwell. An analog of the minimax theorem for vector payo#s. Pacific J. Math., 6(1):1--8, 1956.
Smooth Online Learning of Expert Advice - Yaroshinsky, El-Yaniv (2001) (2 citations) (Correct)
....utilize the expert advice. This methodology of worst case analysis of online algorithms has been emerged and used in various disciplines such as statistics [Che54, Mil54] where it is called regret analysis) computer science [ST85, BEY98] where it is called competitive analysis) game theory [Bla56] and information theory [Cov91, FMG92] We use this approach here. The problem of online prediction using expert advice falls within the more general context of online classification and regression, whereby a learning algorithm needs to predict the label or value assigned to each of a sequence of ....
D. Blackwell. An analog of the minimax theorem for vector payo#s. Pacific J. Math., 6:1--8, 1956.
Unknown - (Correct)
No context found.
D. Blackwell "An analog of the minimax theorem for vector payo#s," Pacific J. Math., 6, 1, pp. 1-8, 1956.
Probabilistic Pricebots - Amy Greenwald Department (2000) (3 citations) (Correct)
No context found.
D. Blackwell. An analog of the minimax theorem for vector payo s. Paci c Journal of Mathematics, 6:1-8, 1956.
Bounds for Regret-Matching Algorithms - Amy Greenwald Amy (Correct)
No context found.
David Blackwell. An analog of the minimax theorem for vector payo#s. Pacific Journal of Mathematics, 6: 1--8, 1956.
Unknown - (Correct)
No context found.
D. Blackwell. An analog of the minimax theorem for vector payo#s. Pacific J. Math., 6:1--8, 1956.
Potential-based Algorithms in On-line Prediction and Game.. - Cesa-Bianchi, Lugosi (2001) (Correct)
No context found.
D. Blackwell. An analog of the minimax theorem for vector payos. Paci c Journal of Mathematics, 6:18, 1956.
A General Class of No-Regret Learning Algorithms and.. - Greenwald, Jafari (2003) (1 citation) (Correct)
No context found.
D. Blackwell. An analog of the minimax theorem for vector payo s. Paci c Journal of Mathematics, 6:1-8, 1956.
On No-Regret Learning, Fictitious Play, and Nash.. - Greenwald, Jafari.. (2001) (Correct)
No context found.
D. Blackwell. An analog of the minimax theorem for vector payo s. Paci c Journal of Mathematics, 6:1-8, 1956.
Online Convex Programming and Generalized Infinitesimal Gradient .. - Zinkevich (2003) (6 citations) (Correct)
No context found.
D. Blackwell. An analog of the minimax theorem for vector payo s. South Paci c J. of Mathematics, pages 1-8, 1956.
On-line Learning with Imperfect Monitoring - Mannor, Shimkin (2003) (Correct)
No context found.
D. Blackwell. An analog of the minimax theorem for vector payo#s. Pacific J. Math., 6(1):1--8, 1956.
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