Fixed point theorems for increasing correspondences on lattices
Lu YU
What the paper says
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.
Evidence weight
0.50
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.