most citedClairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.GT2022★ 1 cited

Clairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games

Gabriele Farina, Christian Kroer, Chung-Wei Lee +1

A recent paper by Piliouras et al. [2021, 2022] introduces an uncoupled learning algorithm for normal-form games -- called Clairvoyant MWU (CMWU). In this note we show that CMWU is…