期刊
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
卷 59, 期 1-2, 页码 85-112出版社
SPRINGER
DOI: 10.1007/s10589-014-9642-3
关键词
Nash equilibrium problem; Nondifferentiable objective function; Distributed algorithm; Smoothing
资金
- 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
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据