arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.01548math.OC
收藏

分布式鲁棒对策的算法设计与逼近分析

Algorithm design and approximation analysis on distributed robust game

Gehui Xu, Guanpu Chen, Hongsheng Qi

摘要:

设计了一个分布式算法来求解具有不确定耦合约束的鲁棒博弈的广义纳什均衡。由于集合约束中参数的不确定性,我们的目标是在最坏的情况下找到一个广义纳什均衡。然而,直接获得精确的平衡点是具有挑战性的,因为参数来自一般的凸集,这些凸集可能没有解析表达式或被赋予高维非线性。为了解决这个问题,我们首先近似的参数集与内接多面体,并在最坏情况下的近似问题转化为一个扩展的确定性博弈的资源分配约束的鲁棒优化。然后我们提出了一个分布式算法,并证明了从该算法得到的均衡诱导原游戏的$ε$ -广义纳什均衡,其次是收敛性分析。此外,借助于度量空间和对非线性扰动系统的分析,我们估计了与$ε$有关的逼近精度,并指出了影响$ε$精度的因素。

英文摘要:

We design a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints. Due to the uncertainty of parameters in set constraints, we aim to find a generalized Nash equilibrium in the worst case. However, it is challenging to obtain the exact equilibria directly because the parameters are from general convex sets, which may not have analytic expressions or are endowed with high-dimensional nonlinearities. To solve this problem, we first approximate parameter sets with inscribed polyhedrons, and transform the approximate problem in the worst case into an extended certain game with resource allocation constraints by robust optimization. Then we propose a distributed algorithm for this certain game and prove that an equilibrium obtained from the algorithm induces an $ε$-generalized Nash equilibrium of the original game, followed by convergence analysis. Moreover, resorting to the metric spaces and the analysis on nonlinear perturbed systems, we estimate the approximation accuracy related to $ε$ and point out the factors influencing the accuracy of $ε$.

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

↑