min, max, and sum (Q1851231)

The authors provide characterization theorems for preferences that can be represented by the minimum, the maximum, the sum, or combinations of these functionals. A weak version of separability, called partial separability, is introduced. It states that changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. Applications to social choice are discussed.