Online Learning and Game Theory. A quick overview with recent results and applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ESAIM: Proceedings Year : 2015

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.

Dates and versions

hal-01237039 , version 1 (07-12-2015)

Identifiers

Cite

Mathieu Faure, Pierre Gaillard, Bruno Gaujal, Vianney Perchet. Online Learning and Game Theory. A quick overview with recent results and applications. ESAIM: Proceedings, 2015, 51, pp.246 - 271. ⟨10.1051/proc/201551014⟩. ⟨hal-01237039⟩
400 View
1 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More