Back to search

University of British Columbia

Last iterate convergence in network zero-sum games

Abstract

dc:description

Motivated by Generative Adverserial Networks, we study the computation of a Nash equilibrium in concave network zero-sum games (NZSGs), a multiplayer generalization of two-player zero-sum games first proposed with linear payoffs. Extending previous results, we show that various game theoretic properties of convex-concave two-player zero-sum games are preserved in this generalization. We then generalize last iterate convergence results obtained previously in two-player zero-sum games. We analyze convergence rates when players update their strategies using Mirror Descent, and Optimistic Mirror Descent. We analyze these algorithms when they are used with the squared l2 norm as a regularizer --- yielding Gradient Ascent, Extra-Gradient Method, and Optimistic Gradient Ascent. We show exponential convergence when the payoffs of players are linear, or strongly concave and smooth. For the more general method of Optimistic Mirror Descent, we show last iterate convergence for any monotone game with bounded gradients, as well as monotonic convergence in games with strictly monotone and smooth payoffs.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
University of British Columbia
Year dc:date
2020

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kadan, Amit

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/77049

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Kadan, Amit. Last iterate convergence in network zero-sum games. master's thesis, University of British Columbia, 2020. http://hdl.handle.net/2429/77049