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
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)
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 (13) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
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 ().