Fixed point theorems for increasing correspondences on lattices
Abstract
Abstract For an ascending correspondence $$F:X\rightarrow 2^X$$ F : X → 2 X with chain-complete values on a complete lattice X , we prove that the set of fixed points is a complete lattice. This generalizes Zhou’s fixed point theorem. We provide an application to games with strategic complementarities.
Fields of Study & Subjects
Fixed Point Theorems Analysis
Game Theory and Applications
Advanced Algebra and Logic
Publication details
- Journal / source
- Economic Theory
- Publication date
- 5 March 2026
- Language
- EN