Designing efficient algorithms to compute Nash equilibria poses considerable challenges in Algorithmic Game Theory (AGT). We shed new light on the intersection between Algorithmic Game Theory and Integer Programming: we introduce ZERO Regrets,…

Thursday, the 17th of February 2022, I defended my doctoral research on Mathematical Programming Games at Polytechnique. While my thesis is available here, I will try to condense in a few lines what are Mathematical Programming Games and why we should care for them. …

The concept of Nash equilibrium enlightens the structure of rational behavior in multi-agent settings. However, the concept is as helpful as one may compute it efficiently. We introduce the Cut-and-Play, an algorithm to compute Nash equilibria…