research
∙
07/14/2022
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
Since the seminal PPAD-completeness result for computing a Nash equilibr...
share
research
∙
04/25/2022
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
Since the celebrated PPAD-completeness result for Nash equilibria in bim...
research
∙
06/07/2021
Forward Looking Best-Response Multiplicative Weights Update Methods
We propose a novel variant of the multiplicative weights update method w...
research
∙
06/11/2020
Cumulant GAN
Despite the continuous improvements of Generative Adversarial Networks (...
research
∙
11/06/2018
Training Generative Adversarial Networks with Weights
The impressive success of Generative Adversarial Networks (GANs) is ofte...
research
∙
07/25/2018
Jamming in multiple independent Gaussian channels as a game
We study the problem of jamming in multiple independent Gaussian channel...
research
∙
06/05/2018