Generalization of Zhou fixed point theorem
Lu Yu

TL;DR
This paper extends Zhou's fixed point theorem by weakening key conditions and applies these results to generalize Topkis's theorem on Nash equilibria in supermodular games.
Contribution
It introduces two new generalizations of Zhou's fixed point theorem, relaxing the subcompleteness and ascending conditions.
Findings
Generalized fixed point theorem under weaker conditions
Extended Topkis's theorem for Nash equilibria
Broader applicability in supermodular game analysis
Abstract
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 Topkis's theorem on the existence and order structure of the set of Nash equilibria of supermodular games.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFixed Point Theorems Analysis · Optimization and Variational Analysis
MethodsSparse Evolutionary Training
