Operators and Laws for Combining Preference Relations
Copyright policy )Operators and Laws for Combining Preference Relations
The authors define the concept of priority operator. It maps a family of relations to a single relation which represents their lexicographic combination according to a certain priority on the family of relations. The paper is a theoretical study of such operators for combining ordering relations. The results can be applied in the theory of social choice, artificial intelligence and other areas.
- University of Namur Belgium
Logic in artificial intelligence, preference relations, social choice, Social choice, Logics of knowledge and belief (including belief change), Individual preferences, lexicographic combination, Arrow's theorem, default reasoning, priority relations
Logic in artificial intelligence, preference relations, social choice, Social choice, Logics of knowledge and belief (including belief change), Individual preferences, lexicographic combination, Arrow's theorem, default reasoning, priority relations
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).79 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!