Convex-Concave Min-Max Stackelberg Games

by   Denizalp Goktas, et al.

Min-max optimization problems (i.e., min-max games) have been attracting a great deal of attention because of their applicability to a wide range of machine learning problems. Although significant progress has been made recently, the literature to date has focused on games with independent strategy sets; little is known about solving games with dependent strategy sets, which can be characterized as min-max Stackelberg games. We introduce two first-order methods that solve a large class of convex-concave min-max Stackelberg games, and show that our methods converge in polynomial time. Min-max Stackelberg games were first studied by Wald, under the posthumous name of Wald's maximin model, a variant of which is the main paradigm used in robust optimization, which means that our methods can likewise solve many convex robust optimization problems. We observe that the computation of competitive equilibria in Fisher markets also comprises a min-max Stackelberg game. Further, we demonstrate the efficacy and efficiency of our algorithms in practice by computing competitive equilibria in Fisher markets with varying utility structures. Our experiments suggest potential ways to extend our theoretical results, by demonstrating how different smoothness properties can affect the convergence rate of our algorithms.



There are no comments yet.


page 1

page 2

page 3

page 4


Robust No-Regret Learning in Min-Max Stackelberg Games

The behavior of no-regret learning algorithms is well understood in two-...

Playing Games with Bounded Entropy: Convergence Rate and Approximate Equilibria

We consider zero-sum repeated games in which the players are restricted ...

FIXP-membership via Convex Optimization: Games, Cakes, and Markets

We introduce a new technique for proving membership of problems in FIXP ...

Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization

Min-max optimization is emerging as a key framework for analyzing proble...

First-Order Methods with Increasing Iterate Averaging for Solving Saddle-Point Problems

First-order methods are known to be among the fastest algorithms for sol...

Enhanced First and Zeroth Order Variance Reduced Algorithms for Min-Max Optimization

Min-max optimization captures many important machine learning problems s...

A Hölderian backtracking method for min-max and min-min problems

We present a new algorithm to solve min-max or min-min problems out of t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.