Logical preference representation and combinatorial vote
From MaRDI portal
Recommendations
- Voting in combinatorial domains
- Voting in Combinatorial Domains: What Logic and AI Have to Say
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Voting on multi-issue domains with conditionally lexicographic preferences
- Using elections to represent preferences
Cited in
(30)- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Representing interval orders by weighted bases: some complexity results
- Propositional distances and compact preference representation
- Incompleteness and incomparability in preference aggregation: complexity results
- Voting in Combinatorial Domains: What Logic and AI Have to Say
- Compactly representing utility functions using weighted goals and the Max aggregator
- Graph aggregation
- Representing Utility Functions via Weighted Goals
- A distributed social choice protocol for combinatorial domains
- Graphically structured value-function compilation
- Twenty-Five Years of Preferred Subtheories
- Computing a small agreeable set of indivisible items
- Aggregating conditionally lexicographic preferences using answer set programming solvers
- Choosing combinatorial social choice by heuristic search
- Lifting integrity constraints in binary aggregation
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Voting in combinatorial domains
- Sequential composition of voting rules in multi-issue domains
- Preferences in artificial intelligence
- Using elections to represent preferences
- Computational techniques for a simple theory of conditional preferences
- Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
- Expressive efficiency of two kinds of specific CP-nets
- ANSWER SET PROGRAMMING AND COMBINATORIAL MULTICRITERIA DECISION MAKING
- Influence across agents and issues in combinatorial and collective decision-making
- Reaching a joint decision with minimal elicitation of voter preferences
- Non-exclusive hypotheses in Dempster-Shafer theory
- Voting procedures, complexity of
- Using Logic to Understand Relations between DSmT and Dempster-Shafer Theory
- Choice logics and their computational properties
This page was built for publication: Logical preference representation and combinatorial vote
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702101)
