首页> 外文会议>IEEE International Conference on Control and Automation >A Distributed Method for Simultaneous Social Cost Minimization and Nash Equilibrium Seeking in Multi-agent Games
【24h】

A Distributed Method for Simultaneous Social Cost Minimization and Nash Equilibrium Seeking in Multi-agent Games

机译:一种分布式方法,用于多智能体游戏中的同时社会成本最小化和纳什均衡

获取原文

摘要

In this paper, a fully distributed strategy is proposed to solve the N-coalition multi-agent games. The agents in the considered N-coalition multi-agent games are supposed to have limited access to the other players' actions. Consensus protocols, including a leader-following consensus protocol and a dynamic average consensus protocol, are leveraged to search for the Nash equilibrium of the N-coalition multi-agent games. In particular, the leader-following consensus protocol is employed to estimate the agents' actions and the dynamic average consensus protocol is employed to deal with the social cost minimization problem in each coalition. Analytical convergence result is derived under certain conditions by utilizing Lyapunov stability analysis.
机译:在本文中,提出了一种全部分布式策略来解决N-Coalition多智能体游戏。被审议的N-Coalition Multi-Agent Games中的代理商应该有限地访问其他球员的行为。互联协商议定书,包括领导议定书和动态平均共识议定书,可利用寻找N-Coalition多智能体游戏的纳什均衡。特别是,遵守领导者遵循的达成协议议定书估计代理人的行动,而动态平均共识议定书将受雇于每个联盟的社会成本最小化问题。通过利用Lyapunov稳定性分析,在某些条件下衍生分析会聚结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号