Subextremal functions and lattice programming

Marco LiCalzi and Arthur F. Veinott
Additional contact information
Arthur F. Veinott: Stanford University

GE, Growth, Math methods from University Library of Munich, Germany

Abstract: Let M and N be the set of minimizers of a function f over respective subsets K and L of a lattice, with K being lower than L. This paper characterizes the class of functions f for which M is lower (resp., weakly lower, meet lower, join lower, chain lower) than N for all K lower than L. The resulting five classes of functions, called subextremal variants, have alternate characterizations by variants of the downcrossing-differences property, i.e., their first differences change sign at most once from plus to minus along complementary chains.

Keywords: Comparative statics; supermodular functions (search for similar items in EconPapers)
JEL-codes: C6 D5 D9 (search for similar items in EconPapers)
Pages: 21 pages
Date: 2005-09-04
Note: Type of Document - pdf; pages: 21. 21 pages, scanned from original on paper to a PDF
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
https://econwpa.ub.uni-muenchen.de/econ-wp/ge/papers/0509/0509001.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpge:0509001

Access Statistics for this paper

More papers in GE, Growth, Math methods from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA ( this e-mail address is bad, please contact ).