arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.0193math.OCcs.NAmath.DSmath.NAstat.ML
收藏

关于具有随机状态相关收益的纳什寻求算法的收敛性

On The Convergence of a Nash Seeking Algorithm with Stochastic State Dependent Payoff

Institut Mines-Télécom, Télécom SudParis(电信大学);Ecole Superieure d’Electricite (Supelec)(高等电力学院)

A. F. Hanif, H. Tembine, M. Assaad, D. Zeghlache

AI总结:

本文提出一种分布式随机状态相关收益下的纳什均衡寻求算法,证明其收敛到常微分方程定义的极限轨迹,并给出误差界。

摘要:

近年来,分布式战略学习受到关注。随着系统变得分布式,以分布式方式寻找纳什均衡对各种应用变得越来越重要。在本文中,我们开发了一个分布式战略学习框架,用于在随机状态相关收益函数下寻找纳什均衡。我们将Krstic等人[1]的工作扩展到随机状态相关收益函数的情况。我们开发了一种迭代分布式纳什寻求算法,并研究其收敛到由常微分方程(ODE)定义的极限轨迹。我们证明了所提算法在步长趋于零时的收敛性,并给出了固定步长的误差界。最后,我们进行了稳定性分析,并将所提方案应用于通用无线网络。我们还提供了数值结果,证实了我们的主张。

英文摘要:

Distributed strategic learning has been getting attention in recent years. As systems become distributed finding Nash equilibria in a distributed fashion is becoming more important for various applications. In this paper, we develop a distributed strategic learning framework for seeking Nash equilibria under stochastic state-dependent payoff functions. We extend the work of Krstic et.al. in [1] to the case of stochastic state dependent payoff functions. We develop an iterative distributed algorithm for Nash seeking and examine its convergence to a limiting trajectory defined by an Ordinary Differential Equation (ODE). We show convergence of our proposed algorithm for vanishing step size and provide an error bound for fixed step size. Finally, we conduct a stability analysis and apply the proposed scheme in a generic wireless networks. We also present numerical results which corroborate our claim.

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

↑