Lexicographic aggregation of semiorders

DOI10.1002/MCDA.4020010106zbMATH Open0838.90011OpenAlexW1985455246MaRDI QIDQ4863872FDOQ4863872

Authors: Marc Pirlot, Philippe Vincke 

Publication date: 28 January 1996

Published in: Journal of Multi-Criteria Decision Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mcda.4020010106

Recommendations

• Lexicographic orders and preference representation
• Essentially lexicographic aggregation
• Aggregation of semiorders: Intransitive indifference makes a difference
• Expanding and confusing space of alternatives: a case for lexicographic preferences
• A completeness result for extending signed orders

zbMATH Keywords

semiorderslexicographic aggregation of complete preorders

Mathematics Subject Classification ID

Individual preferences (91B08)

Cites Work

• Interval graphs and interval orders

Cited In (9)

• Bipolar preference modeling and aggregation in decision support
• Any complete preference structure without circuit admits an interval representation
• A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths
• Aggregation of semiorders: Intransitive indifference makes a difference
• Bi-semiorders with frontiers on finite sets
• Essentially lexicographic aggregation
• Unit representation of semiorders. I: Countable sets
• A theoretical look at \textsc{Electre Tri}-nB and related sorting models
• Lexicographic semigroupoids

This page was built for publication: Lexicographic aggregation of semiorders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863872)