首页> 外文期刊>Automation and Remote Control >Decomposition algorithm of searching equilibria in a dynamic game
【24h】

Decomposition algorithm of searching equilibria in a dynamic game

机译:动态博弈中寻找平衡点的分解算法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper considers a noncooperative game of several players (governments of neighboring countries) participating in emission reduction trading. A special emphasis is placed on the case of two players, one representing Eastern European countries and the other being the countries of the former Soviet Union. We perform statistical analysis of the model parameters based on real data under quadratic cost functions and logarithmic utility functions. The concepts of a noncooperative Nash equilibrium and cooperative Pareto maxima are introduced and connections between them are established. A new concept, i.e., a market equilibrium, which combines the properties of Nash and Pareto equilibria, is rigorously defined. An analytical solution of the market equilibrium problem is given. This analytical solution can serve for verification of numerical search algorithms. In addition, we propose a computational algorithm of market equilibrium search, which shifts a competitive Nash equilibrium to a cooperative Pareto maximum. The algorithm is interpreted as a repeated auction, where the auctioneer possesses no information about the cost functions and the functions of environmental effect from emission reduction of the participating countries. An auctioneer strategy leading to market equilibrium attainment is considered. From the game-theoretic viewpoint, a repeated auction describes a learning process in a noncooperative repeated game under uncertainty. We compare the results gained by the proposed computational algorithms with their analytical counterparts. And finally, numerical calculations of equilibrium and algorithm trajectories converging to the equilibrium are demonstrated.
机译:本文考虑了参与减排交易的几个参与者(邻国政府)的非合作博弈。特别强调两个参与者的情况,一个代表东欧国家,另一个代表前苏联国家。我们根据二次成本函数和对数效用函数下的实际数据对模型参数进行统计分析。引入了非合作纳什均衡和合作帕累托极大值的概念,并建立了它们之间的联系。严格定义了一个新概念,即市场均衡,它结合了纳什和帕累托均衡的性质。给出了市场均衡问题的解析解。该分析解决方案可用于验证数字搜索算法。此外,我们提出了一种市场均衡搜索的计算算法,该算法将竞争性纳什均衡转移到合作帕累托最大值。该算法被解释为重复拍卖,其中拍卖师不了解有关成本函数和参与国减排产生的环境效应函数的信息。考虑一种导致市场均衡的拍卖策略。从博弈论的角度来看,重复拍卖描述了不确定性下非合作重复博弈的学习过程。我们将所提出的计算算法与分析对应方法所获得的结果进行比较。最后,证明了平衡的数值计算和收敛于平衡的算法轨迹。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号