Lexicographic aggregation of semiorders
Journal of Multi-Criteria Decision Analysis1992Vol. 1(1), pp. 47–58
Citations Over Time
Abstract
Abstract It is well known that the lexicographic aggregation of complete preorders gives a complete preorder. Unfortunately, this property is no longer true when the lexicographic rule is applied to semiorders. In this paper we study some ways of defining a lexicographic aggregation of semiorders and the properties of the resulting structures.
Related Papers
- → Lexicographical order, lexicographical index, and linear operators(1990)10 cited
- → Lexicographic aggregation of semiorders(1992)14 cited
- → New Approaches to Solving Discrete Programming Problems on the Basis of Lexicographic Search(2016)2 cited
- Continuous Lexicographic Preferences(2003)
- Susquehanna Chorale Spring Concert "Roots and Wings"(2017)