paint-brush

This story draft by @oligopoly has not been reviewed by an editor, YET.

A Consensus-Based Algorithm for Non-Convex Multiplayer Games: Quantitative Laplace principle

featured image - A Consensus-Based Algorithm for Non-Convex Multiplayer Games: Quantitative Laplace principle
Oligopoly HackerNoon profile picture
0-item

Table of Links

Abstract and 1 Introduction

2 Global convergence

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








This paper is available on arxiv under CC BY 4.0 DEED license.


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.