Excess demand approach with non-convexity and discontinuity: a generalization of the Gale–Nikaido–Kuhn–Debreu lemma

M. Ali Khan et al.

Economic Theory2025https://doi.org/10.1007/s00199-025-01641-9article
AJG 3ABDC A*
Weight
0.48

Abstract

This paper provides a three-fold generalization of the Gale–Nikaido–Kuhn–Debreu lemma, a fundamental result for classical Walrasian general equilibrium theory. It weakens the (i) convexity assumption on the given (excess demand) correspondence, and (ii) the continuity assumption by synthesizing both the majorization and inclusion approaches, and uses these results to derive a (iii) theorem on the existence of a Walrasian equilibrium in an exchange economy with externalities, and non-ordered, non-convex, price-dependent preferences under a weaker continuity assumption that is assumed in the literature. It also highlights a trade-off between the weakened continuity and convexity assumptions.

5 citations

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1007/s00199-025-01641-9

Or copy a formatted citation

@article{m.2025,
  title        = {{Excess demand approach with non-convexity and discontinuity: a generalization of the Gale–Nikaido–Kuhn–Debreu lemma}},
  author       = {M. Ali Khan et al.},
  journal      = {Economic Theory},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1007/s00199-025-01641-9},
}

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

Flag this paper

Excess demand approach with non-convexity and discontinuity: a generalization of the Gale–Nikaido–Kuhn–Debreu lemma

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


Evidence weight

0.48

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

F · citation impact0.41 × 0.4 = 0.16
M · momentum0.63 × 0.15 = 0.09
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.