Existence and structure of Nash equilibria for supermodular games
Two theorems announced by Topkis about the topological description of sublattices are proved. They are applied to extend some classical results concerning the existence and the order structure of Nash equilibria of certain supermodular games, with some problems in Zhou's proof corrected.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Nash equilibria of quasisupermodular games
We prove three results on the existence and structure of Nash equilibria for quasisupermodular games. A theorem is purely order-theoretic, and the other two involve topological hypotheses. Our topological results genrali…
Generalization of Zhou fixed point theorem
We give two generalizations of the Zhou fixed point theorem. They weaken the subcompleteness condition of values, and relax the ascending condition of the correspondence. As an application, we derive a generalization of …
Nash equilibria of games with generalized complementarities
To generalize complementarities for games, we introduce some conditions weaker than quasisupermodularity and the single crossing property. We prove that the Nash equilibria of a game satisfying these conditions form a no…
On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games
We propose local symplectic surgery, a two-timescale procedure for finding local Nash equilibria in two-player zero-sum games. We first show that previous gradient-based algorithms cannot guarantee convergence to local N…
Generative Adversarial NetworkGraphon games and an idealized limit of large network games
Graphon games are a class of games with a continuum of agents, introduced to approximate the strategic interactions in large network games. The first result of this study is an equilibrium existence theorem in graphon ga…