Binary relations: Finite characterizations and computational complexity

DOI10.1007/s11238-007-9079-6zbMath1140.91341OpenAlexW1972917178MaRDI QIDQ935039

Vicki Knoblauch

Publication date: 31 July 2008

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11238-007-9079-6

zbMATH Keywords

votingpreferencesPareto order

Mathematics Subject Classification ID

Group preferences (91B10) Individual preferences (91B08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arbres et dimension des ordres
• Paretian quasi-orders: the regular two-agent case
• Characterizing Paretian preferences
• A decomposition theorem for partially ordered sets
• Continuity Properties of Paretian Utility
• Partially Ordered Sets

This page was built for publication: Binary relations: Finite characterizations and computational complexity