7 citations · 14 across the 7 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.GT2021
Time-Average Convergence in a Generalization of Multiagent Zero-Sum Games
James P. Bailey
We introduce a generalization of zero-sum network multiagent matrix games and prove that alternating gradient descent converges to the set of Nash equilibria at rate for t…
cs.GT2021★ 1 cited
Stochastic Multiplicative Weights Updates in Zero-Sum Games
James P. Bailey, Sai Ganesh Nagarajan, Georgios Piliouras
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…
cs.GT2021
Conditions for Stability in Strategic Matching
James P. Bailey, Craig A. Tovey
We consider the stability of matchings when individuals strategically submit preference information to a publicly known algorithm. Most pure Nash equilibria of the ensuing game yie…