Skip to yearly menu bar Skip to main content


Poster

On Tractable $\Phi$-Equilibria in Non-Concave Games

Yang Cai · Constantinos Daskalakis · Haipeng Luo · Chen-Yu Wei · Weiqiang Zheng

[ ]
Thu 12 Dec 4:30 p.m. PST — 7:30 p.m. PST

Abstract: While Online Gradient Descent and other no-regret learning procedures are known to efficiently converge to a coarse correlated equilibrium in games where each agent's utility is concave in their own strategy, this is not the case when utilities are non-concave -- a common scenario in machine learning applications involving strategies parameterized by deep neural networks, or when agents' utilities are computed by neural networks, or both. Non-concave games introduce significant game-theoretic and optimization challenges: (i) Nash equilibria may not exist; (ii) local Nash equilibria, though existing, are intractable; and (iii) mixed Nash, correlated, and coarse correlated equilibria generally have infinite support and are intractable. To sidestep these challenges, we revisit the classical solution concept of $\Phi$-equilibria introduced by \citet{greenwald2003general}, which is guaranteed to exist for an arbitrary set of strategy modifications $\Phi$ even in non-concave games \citep{stoltz2007learning}. However, the tractability of $\Phi$-equilibria in such games remains elusive. In this paper, we initiate the study of tractable $\Phi$-equilibria in non-concave games and examine several natural families of strategy modifications. We show that when $\Phi$ is finite, there exists an efficient uncoupled learning algorithm that converges to the corresponding $\Phi$-equilibria. Additionally, we explore cases where $\Phi$ is infinite but consists of local modifications, showing that Online Gradient Descent can efficiently approximate $\Phi$-equilibria in non-trivial regimes.

Live content is unavailable. Log in and register to view live content