scientific article; zbMATH DE number 1804097

MaRDI QIDQ3148799zbMATH OpenFDO

Authors Nicolò Cesa-Bianchi, Gábor Lugosi

Publication date 22 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2111/21110048

zbMATH Keywords

boostingon-line learningperceptron algorithmuniversal predictionBlackwell's strategyinternal regretweighted average predictors

Mathematics Subject Classification ID

Computational learning theory (68Q32) Decision theory for games (91A35)

Recommendations

• Potential-based algorithms in on-line prediction and game theory
• Prediction, Learning, and Games
• Learning Theory
• From external to internal regret
• Adaptive game playing using multiplicative weights

Cited in

(6)

• Replicator dynamics: old and new
• Online calibrated forecasts: memory efficiency versus universality for learning in games
• Drifting games
• Potential-based algorithms in on-line prediction and game theory
• Algorithmic Learning Theory
• Online prediction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148799)