Online Learning and Game Theory. A quick overview with recent results and applications

Abstract : We study one of the main concept of online learning and sequential decision problem known as regret minimization. We investigate three different frameworks, whether data are generated accordingly to some i.i.d. process, or when no assumption whatsoever are made on their generation and, finally, when they are the consequences of some sequential interactions between players. The overall objective is to provide a comprehensive introduction to this domain. In each of these main setups, we define and analyze classical algorithms and we analyze their performances. Finally, we also show that some concepts of equilibria that emerged in game theory are learnable by players using online learning schemes while some other concepts are not learnable.
Type de document :
Article dans une revue
ESAIM: Proceedings, EDP Sciences, 2015, 51, pp.246 - 271. <10.1051/proc/201551014>
Liste complète des métadonnées

https://hal.inria.fr/hal-01237039
Contributeur : Bruno Gaujal <>
Soumis le : lundi 7 décembre 2015 - 15:18:20
Dernière modification le : mardi 21 février 2017 - 15:28:12

Identifiants

Citation

Mathieu Faure, Pierre Gaillard, Bruno Gaujal, Vianney Perchet. Online Learning and Game Theory. A quick overview with recent results and applications . ESAIM: Proceedings, EDP Sciences, 2015, 51, pp.246 - 271. <10.1051/proc/201551014>. <hal-01237039>

Partager

Métriques

Consultations de la notice

217