Generalization of Zhou fixed point theorem

2024/07/25 by Lu Yu, Yu, Lu
Mathematics · Computer Science · #Fixed Point Theorems Analysis #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.2407.17884

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.

Related

• Existence and structure of Nash equilibria for supermodular games
• Nash equilibria of quasisupermodular games
• Nash equilibria of games with generalized complementarities
• Computations and Complexities of Tarski's Fixed Points and Supermodular Games
• Order-theoretical fixed point theorems for correspondences and application in game theory