Premium
Multicriteria efficiency with arbitrary finite sets and cyclic preferences
Author(s) -
Fishburn Peter C.
Publication year - 1988
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198812)35:6<567::aid-nav3220350605>3.0.co;2-d
Subject(s) - finite set , extension (predicate logic) , preference , mathematics , set (abstract data type) , product (mathematics) , factor (programming language) , mathematical optimization , mathematical economics , discrete mathematics , computer science , statistics , mathematical analysis , geometry , programming language
It is shown that when X is an arbitrary finite subset of an n ‐factor product set and preference relations on each factor or criterion are assumed only to be asymmetric, efficient (undominated) points always exist in the set P of probability distributions on X when the preference relations are extended to probability distributions on the factors according to SSB utility theory. Thus, arbitrary finite structures and potentially cyclic preferences do not present a problem for the theory of efficiency under the convexification‐extension procedure.