Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.00934 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908858776027136 |
|---|---|
| author | Xiao, Zhuoyu Shanbhag, Uday V. |
| author_facet | Xiao, Zhuoyu Shanbhag, Uday V. |
| contents | Best-response (BR) schemes represent an important avenue for learning equilibria in noncooperative games. However, extant rate guarantees for BR schemes generally necessitate stringent smoothness requirements on player objectives and the availability of suitably defined eigenvalue bounds, significantly limiting the reach of such schemes, and few schemes if any exist for the efficient resolution of a broad class of nonsmooth and nonconvex games with expectation-valued objectives. This motivates our study of Moreau-smoothed BR schemes that allow for nonsmooth objectives. First, we consider a class of nonsmooth and strongly convex games (but potentially non-monotone) under uncertainty. By presenting an equilibrium invariance claim, we present synchronous and asynchronous schemes, equipped with linear and sublinear rate guarantees and associated complexity statements. Second, faced by weakly convex player objectives, we incorporate surrogation into the Moreau-smoothed best-response and show that the resulting smoothed quasi-Nash equilibrium (QNE) constitutes an $\mathcal{O}(η)$-QNE of the original weakly convex game, where $η> 0$ denotes the Moreau smoothing parameter. In this setting, we again present synchronous and asynchronous BR schemes, equipped with linear and sublinear rates and analogous complexity bounds. Preliminary numerics on a range of such games appear promising. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_00934 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Equilibrium Invariance, Proximality, and Surrogation: Moreau-Smoothed Best-Response Pathways in Stochastic Nonsmooth Games Xiao, Zhuoyu Shanbhag, Uday V. Optimization and Control Best-response (BR) schemes represent an important avenue for learning equilibria in noncooperative games. However, extant rate guarantees for BR schemes generally necessitate stringent smoothness requirements on player objectives and the availability of suitably defined eigenvalue bounds, significantly limiting the reach of such schemes, and few schemes if any exist for the efficient resolution of a broad class of nonsmooth and nonconvex games with expectation-valued objectives. This motivates our study of Moreau-smoothed BR schemes that allow for nonsmooth objectives. First, we consider a class of nonsmooth and strongly convex games (but potentially non-monotone) under uncertainty. By presenting an equilibrium invariance claim, we present synchronous and asynchronous schemes, equipped with linear and sublinear rate guarantees and associated complexity statements. Second, faced by weakly convex player objectives, we incorporate surrogation into the Moreau-smoothed best-response and show that the resulting smoothed quasi-Nash equilibrium (QNE) constitutes an $\mathcal{O}(η)$-QNE of the original weakly convex game, where $η> 0$ denotes the Moreau smoothing parameter. In this setting, we again present synchronous and asynchronous BR schemes, equipped with linear and sublinear rates and analogous complexity bounds. Preliminary numerics on a range of such games appear promising. |
| title | Equilibrium Invariance, Proximality, and Surrogation: Moreau-Smoothed Best-Response Pathways in Stochastic Nonsmooth Games |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2603.00934 |