Lexicographic aggregation of semiorders
Marc Pirlot, Philippe Vincke
Abstract
Marc Pirlot, Philippe Vincke
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.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Lexicographical order, Computer science, Mathematics, Combinatorics