Universal Learning of Repeated Matrix Games
<|reference_start|>Universal Learning of Repeated Matrix Games: We study and compare the learning dynamics of two universal learning algorithms, one based on Bayesian learning and the other on prediction with expert advice. Both approaches have strong asymptotic performance guarantees. When confronted with the task of finding good long-term strategies in repeated 2x2 matrix games, they behave quite differently.<|reference_end|>
@article{poland2005universal,
    title={Universal Learning of Repeated Matrix Games},
    author={Jan Poland and Marcus Hutter},
    journal={Proc. 15th Annual Machine Learning Conf. of Belgium and The
  Netherlands (Benelearn 2006) pages 7-14},
    year={2005},
    number={IDSIA-18-05},
    archivePrefix={arXiv},
    eprint={cs/0508073},
    primaryClass={cs.LG cs.AI}
}