Logical preference representation and combinatorial vote
From MaRDI portal
Publication:702101
DOI10.1023/B:AMAI.0000034522.25580.09zbMath1061.68147OpenAlexW2066692416MaRDI QIDQ702101
Publication date: 17 January 2005
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:amai.0000034522.25580.09
Related Items (24)
Propositional distances and compact preference representation ⋮ Preferences in artificial intelligence ⋮ Graphically structured value-function compilation ⋮ Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting ⋮ Compactly representing utility functions using weighted goals and the Max aggregator ⋮ Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities ⋮ Non-exclusive hypotheses in Dempster-Shafer theory ⋮ Computational techniques for a simple theory of conditional preferences ⋮ Incompleteness and incomparability in preference aggregation: complexity results ⋮ Voting in Combinatorial Domains: What Logic and AI Have to Say ⋮ Lifting integrity constraints in binary aggregation ⋮ Voting Procedures, Complexity of ⋮ Graph aggregation ⋮ A distributed social choice protocol for combinatorial domains ⋮ Expressive efficiency of two kinds of specific CP-nets ⋮ Twenty-Five Years of Preferred Subtheories ⋮ Using Logic to Understand Relations between DSmT and Dempster-Shafer Theory ⋮ Representing Utility Functions via Weighted Goals ⋮ ANSWER SET PROGRAMMING AND COMBINATORIAL MULTICRITERIA DECISION MAKING ⋮ Computing a small agreeable set of indivisible items ⋮ Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting ⋮ Sequential composition of voting rules in multi-issue domains ⋮ Representing interval orders by weighted bases: some complexity results ⋮ Choice logics and their computational properties
This page was built for publication: Logical preference representation and combinatorial vote
