Maximizing a preference relation on complete chains and lattices

Nikolai Kukushkin ()

MPRA Paper from University Library of Munich, Germany

Abstract: Maximization of a preference relation on a given family of subsets of its domain defines a choice function. Assuming the domain to be a poset or a lattice, and considering subcomplete chains or sublattices as potential feasible sets, we study conditions ensuring the existence of optima, as well as properties of the choice function conducive to monotone comparative statics. Concerning optimization on chains, quite a number of characterization results are obtained; when it comes to lattices, we mostly obtain sufficient conditions.

Keywords: preference relation; choice function; complete chain; complete lattice; quasisupermodularity; single crossing; monotone selection (search for similar items in EconPapers)
JEL-codes: C61 C72 D11 (search for similar items in EconPapers)
Date: 2023-11-12
New Economics Papers: this item is included in nep-dcm and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/119148/1/MPRA_paper_119148.pdf original version (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:pra:mprapa:119148

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().