Georgios Roussakis

Α Descent-based Method on the Duality Gap for Solving Zero-sum Games

We focus on the design of algorithms for finding equilibria in 2-player zero-sum games. Although it is well known that such problems can be solved by a single linear program, there has been a surge of interest in recent years for simpler algorithms, motivated in part by applications in machine learn