17 citations · 187 across the 55 of their papers we have counts for
4 papers · 1 filter
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina +1
Most of the literature on learning in games has focused on the restrictive setting where the underlying repeated game does not change over time. Much less is known about the conver…
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina +3
Recently, Daskalakis, Fishelson, and Golowich (DFG) (NeurIPS`21) showed that if all agents in a multi-player general-sum normal-form game employ Optimistic Multiplicative Weights U…
Regret Circuits: Composability of Regret Minimizers
Gabriele Farina, Christian Kroer, Tuomas Sandholm
Regret minimization is a powerful tool for solving large-scale problems; it was recently used in breakthrough results for large-scale extensive-form game solving. This was achieved…
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication
Massimo Cairo, Gabriele Farina, Romeo Rizzi
In this paper, we present a novel algorithm for the maximum a posteriori decoding (MAPD) of time-homogeneous Hidden Markov Models (HMM), improving the worst-case running time of th…