Operators and Laws for Combining Preference Relations

The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator maps a family of relations to a single relation which represents their lexicographic combination according to a certain priority on the family of relations. We present four kinds of results.

• Type: Journal
• Year: 2002
• Where: LOGCOM
• Authors: Hajnal Andréka, Mark Ryan, Pierre-Yves Schobbens
• Keywords: Lexicographic Rule, LOGCOM 2002, Preference Relations, Priority Operator