Representing interval orders by weighted bases: some complexity results

DOI10.1016/j.mathsocsci.2008.12.011zbMath1176.91027OpenAlexW2119144556MaRDI QIDQ1042324

Meltem Öztürk, Pierre Marquis

Publication date: 7 December 2009

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/5300

zbMATH Keywords

computational complexitycompact representation of preferencespreferences over combinatorial domains

Mathematics Subject Classification ID

Group preferences (91B10)

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded discrete representations of interval orders
• Logical preference representation and combinatorial vote
• Semiorders. Properties, representations, applications
• Generalizations of semiorders: A review note
• Numerical representation of \(PQI\) interval orders
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• A characterization of PQI interval orders.
• Betweenness, orders and interval graphs
• Semiorders and a Theory of Utility Discrimination
• Foundational aspects of theories of measurement
• Bounded Query Classes
• Threshold Representations of Multiple Semiorders
• Double threshold orders: a new axiomatization

This page was built for publication: Representing interval orders by weighted bases: some complexity results