The problem of seeking strong Nash equilibria of a continuous game is considered. For some games these points cannot be found analytically, only numerically. Interval methods provide us an approach to rigorously verify the existence of equilibria in certain points. A proper algorithm is presented. We formulate and prove propositions, giving us features that have to be used by the algorithm (to the best knowledge of the authors, these propositions and properties are original). Parallelization of the algorithm is considered, also, and numerical results are presented. As a particular example, we consider the game of "misanthropic individuals", a game (invented by the frst author) that may have several strong Nash equilibria, depending on the number of players. Our algorithm is able to localize and verify these equilibria.
Interval methods for computing strong Nash equilibria of continuous games
2016-02-17
doi:10.7494/dmms.2015.9.1.63
Decision Making in Manufacturing and Services; Vol. 9 No. 1 (2015): Special Issue on Game Theory and Applications; 63-78 ; 2300-7087 ; 1896-8325
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
BASE | 2021
|Nonzero-Sum Submodular Monotone-Follower Games. Existence and Approximation of Nash Equilibria
BASE | 2019
|