Primal-Dual Approaches in Online Algorithms, Algorithmic Game Theory and Online Learning

Abstract : Primal-dual is an elegant and powerful method in optimization and in the design of algorithms. The main idea of the method is to construct feasible primal and dual solutions interactively and an algorithm, together with the analysis, are derived naturally from the primal-dual interaction. In this thesis, we present primal-dual approaches as unified techniques in order to study and build connections between the domains of Online Algorithms, Algorithmic Game Theory and Online Learning.
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

Cited literature [130 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/tel-02192531
Contributor : Frédéric Davesne <>
Submitted on : Friday, July 26, 2019 - 10:38:07 PM
Last modification on : Wednesday, July 31, 2019 - 1:15:41 AM

File

HDR_Thang_v2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-02192531, version 1

Citation

Thắng Kim Nguyen. Primal-Dual Approaches in Online Algorithms, Algorithmic Game Theory and Online Learning. Operations Research [cs.RO]. Université Paris Sorbonne, 2019. ⟨tel-02192531⟩

Share

Metrics

Record views

52

Files downloads

103