This content originally appeared on HackerNoon and was authored by Oligopoly
Table of Links
2.1 Quantitative Laplace principle
2.2 Global convergence in mean-field law
3 Numerical experiments and 3.1 One-dimensional illustrative example
3.2 Nonlinear oligopoly games with several goods
4 Conclusion, Acknowledgments, Appendix, and References
2.1 Quantitative Laplace principle
\
\
\
\
\
\
\
:::info This paper is available on arxiv under CC BY 4.0 DEED license.
:::
\
:::info Authors:
(1) Enis Chenchene, Department of Mathematics and Scientific Computing, University of Graz;
(2) Hui Huang, Department of Mathematics and Scientific Computing, University of Graz;
(3) Jinniao Qiu, Department of Mathematics and Statistics, University of Calgary.
:::
\
This content originally appeared on HackerNoon and was authored by Oligopoly
Oligopoly | Sciencx (2024-07-28T13:30:12+00:00) A Consensus-Based Algorithm for Non-Convex Multiplayer Games: Quantitative Laplace principle. Retrieved from https://www.scien.cx/2024/07/28/a-consensus-based-algorithm-for-non-convex-multiplayer-games-quantitative-laplace-principle/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.