))
A Consensus-Based Algorithm for Non-Convex Multiplayer Games: Nonlinear Oligopoly Games
Manage episode 428397116 series 3474369
内容由HackerNoon提供。所有播客内容（包括剧集、图形和播客描述）均由 HackerNoon 或其播客平台合作伙伴直接上传和提供。如果您认为有人在未经您许可的情况下使用您的受版权保护的作品，您可以按照此处概述的流程进行操作https://zh.player.fm/legal。
This story was originally published on HackerNoon at: https://hackernoon.com/a-consensus-based-algorithm-for-non-convex-multiplayer-games-nonlinear-oligopoly-games.
A novel algorithm using swarm intelligence to find global Nash equilibria in nonconvex multiplayer games, with convergence guarantees and numerical experiments.
Check more stories related to gaming at: https://hackernoon.com/c/gaming. You can also check exclusive content about #games, #consensus-based-optimization, #numerical-experiments, #zeroth-order-algorithm, #nonconvex-multiplayer-games, #global-nash-equilibria, #metaheuristics, #mean-field-convergence, and more.
This story was written by: @oligopoly. Learn more about this writer by checking @oligopoly's about page, and for more stories, please visit hackernoon.com.
The study was conducted by Enis Chenchene, Hui Huang, Jinniao Qiu and Hui Chen. They studied the dependence of Algorithm 1 with respect to the algorithm’s parameters to solve (3.5) of good produced. They found no significant differences in the convergence behavior of anisotropic or isotropic dynamics.
135集单集
分享
