Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [64 references]  Display  Hide  Download
Contributor : Bruno Gaujal Connect in order to contact the contributor
Submitted on : Monday, December 7, 2015 - 3:18:20 PM
Last modification on : Tuesday, November 16, 2021 - 4:38:42 AM

Links full text



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⟩



Les métriques sont temporairement indisponibles