Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent

1 code implementation • NeurIPS 2020 • Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis

We consider a natural model of online preference aggregation, where sets of preferred items $R_1, R_2, \ldots, R_t$ along with a demand for $k_t$ items in each $R_t$, appear online.

Dimensionality Reduction

No-regret learning and mixed Nash equilibria: They do not mix

no code implementations • NeurIPS 2020 • Lampros Flokas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras

Understanding the behavior of no-regret dynamics in general $N$-player games is a fundamental question in online learning and game theory.