Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 59, Issue 1-2, Pages 85-112Publisher
SPRINGER
DOI: 10.1007/s10589-014-9642-3
Keywords
Nash equilibrium problem; Nondifferentiable objective function; Distributed algorithm; Smoothing
Funding
- U.S.A. National Science Foundation [CMMI-0969600, CNS-1218717]
- U.S.A. National Science Foundation, CAREER Grant [1254739]
- Directorate For Engineering
- Div Of Electrical, Commun & Cyber Sys [1254739] Funding Source: National Science Foundation
Ask authors/readers for more resources
We consider noncooperative games where each player minimizes the sum of a smooth function, which depends on the player, and of a possibly nonsmooth function that is the same for all players. For this class of games we consider two approaches: one based on an augmented game that is applicable only to a minmax game and another one derived by a smoothing procedure that is applicable more broadly. In both cases, centralized and, most importantly, distributed algorithms for the computation of Nash equilibria can be derived.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
