We study agents competing against each other in a repeated network zero-sum game while applying the multiplicative weights update (MWU) algorithm with fixed learning rates. In our implementation, agents select their strategies probabilistically in each iteration and update their weights/strategies using the realized vector payoff of all strategies, i.e., stochastic MWU with full information. We show that the system results in an irreducible Markov chain where agent strategies diverge from the set of Nash equilibria. Further, we show that agents will play pure strategies with probability 1 in the limit.
@article{arxiv.2110.02134,
title = {Stochastic Multiplicative Weights Updates in Zero-Sum Games},
author = {James P. Bailey and Sai Ganesh Nagarajan and Georgios Piliouras},
journal= {arXiv preprint arXiv:2110.02134},
year = {2021}
}