arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.13115math.OCcs.GT
收藏

求解随机广义Nash均衡的松弛惯性正-反-正算法

A relaxed-inertial forward-backward-forward algorithm for Stochastic Generalized Nash equilibrium seeking

Shisheng Cui, Barbara Franci, Sergio Grammatico, Uday V. Shanbhag, Mathias Staudigl

摘要:

本文提出了一种新的算子分裂算法,用于求解随机不确定性下的分布式纳什均衡,具有松弛和惯性效应。我们的工作受到最近的确定性算子分裂方法的启发,设计用于解决结构单调包含问题。该算法是从一个向前-向后-向前计划解决结构单调包含问题具有Lipschitz连续和单调的游戏运营商。据我们所知,这是第一个分布式(广义)纳什均衡寻求算法,具有加速技术在随机纳什博弈,而不假设cocoercivity。数值例子说明了惯性和松弛对我们所提出的算法的性能的影响。

英文摘要:

In this paper we propose a new operator splitting algorithm for distributed Nash equilibrium seeking under stochastic uncertainty, featuring relaxation and inertial effects. Our work is inspired by recent deterministic operator splitting methods, designed for solving structured monotone inclusion problems. The algorithm is derived from a forward-backward-forward scheme for solving structured monotone inclusion problems featuring a Lipschitz continuous and monotone game operator. To the best of our knowledge, this is the first distributed (generalized) Nash equilibrium seeking algorithm featuring acceleration techniques in stochastic Nash games without assuming cocoercivity. Numerical examples illustrate the effect of inertia and relaxation on the performance of our proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑