arbiter
JournalsAccount

Fixed point theorems for increasing correspondences on lattices

Lu YU

Economic Theory2026https://doi.org/10.1007/s00199-026-01702-7article
AJG 3ABDC A*
Weight
0.50

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.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1007/s00199-026-01702-7

Or copy a formatted citation

@article{lu2026,
  title        = {{Fixed point theorems for increasing correspondences on lattices}},
  author       = {Lu YU},
  journal      = {Economic Theory},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1007/s00199-026-01702-7},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Fixed point theorems for increasing correspondences on lattices

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.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.