Munich Personal RePEc Archive

Maximizing a preference relation on complete chains and lattices

Kukushkin, Nikolai S. (2023): Maximizing a preference relation on complete chains and lattices.

[thumbnail of MPRA_paper_119148.pdf]

Download (269kB) | Preview


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.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.