首页> 外文会议>IEEE International Conference on Control 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-联盟的多智能体博弈。在考虑的N联盟多代理游戏中,代理被认为对其他玩家的行为具有有限的访问权限。共识协议(包括领导者遵循共识协议和动态平均共识协议)被用来搜索N联盟多主体博弈的Nash平衡。特别是,采用领导者遵循共识协议来估计代理人的行为,并使用动态平均共识协议来处理每个联盟中的社会成本最小化问题。利用Lyapunov稳定性分析,可以得出在一定条件下的分析收敛结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号