Aggregating strategies

Research output: Chapter in Book/Report/Conference proceedingConference contribution


The following situation is considered. At each moment of discrete time a decision maker, who does not know the current state of Nature but knows all its past states, must make a decision. The decision together with the current state of Nature determines the loss of the decision maker. The performance of the decision maker is measured by his total loss. We suppose that there is a pool of decision maker's potential strategies one of which is believed to perform well, and construct an "aggregating" strategy for which the total loss is not much bigger than the total loss under strategies in the pool, whatever states of Nature. Our construction generalizes both the Weighted Majority Algorithm of N. Littlestone and M. K. Warmuth and the Bayesian rule.
Original languageEnglish
Title of host publicationProceedings of the Third Annual Workshop on Computational Learning Theory
EditorsM. Fulk, John Case
Place of PublicationSan Mateo, CA
PublisherMorgan Kaufmann
Number of pages13
Publication statusPublished - 1990


  • aggregating algorithm

Cite this