Forward Looking Best-Response Multiplicative Weights Update Methods

by   Michail Fasoulakis, et al.

We propose a novel variant of the multiplicative weights update method with forward-looking best-response strategies, that guarantees last-iterate convergence for zero-sum games with a unique Nash equilibrium. Particularly, we show that the proposed algorithm converges to an η^1/ρ-approximate Nash equilibrium, with ρ > 1, by decreasing the Kullback-Leibler divergence of each iterate by a rate of at least Ω(η^1+1/ρ), for sufficiently small learning rate η. When our method enters a sufficiently small neighborhood of the solution, it becomes a contraction and converges to the Nash equilibrium of the game. Furthermore, we perform an experimental comparison with the recently proposed optimistic variant of the multiplicative weights update method, by <cit.>, which has also been proved to attain last-iterate convergence. Our findings reveal that our algorithm offers substantial gains both in terms of the convergence rate and the region of contraction relative to the previous approach.


A dynamic that evolves toward a Nash equilibrium

In this paper, we study an exponentiated multiplicative weights dynamic ...

Last-Iterate Convergence with Full- and Noisy-Information Feedback in Two-Player Zero-Sum Games

The theory of learning in games is prominent in the AI community, motiva...

An Efficient Approximation Algorithm for the Colonel Blotto Game

In the storied Colonel Blotto game, two colonels allocate a and b troops...

Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions

Understanding the convergence properties of learning dynamics in repeate...

Robust Attacks against Multiple Classifiers

We address the challenge of designing optimal adversarial noise algorith...

The Power of Regularization in Solving Extensive-Form Games

In this paper, we investigate the power of regularization, a common tech...

On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging

We study the stochastic bilinear minimax optimization problem, presentin...