PAPOW: Papow Aggregates Preferences and Orderings to select Winners
Abstract
References
Index Terms
- PAPOW: Papow Aggregates Preferences and Orderings to select Winners
Recommendations
Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting
AbstractAggregating preferences over combinatorial domains has many applications in artificial intelligence (AI). Given the inherent exponential nature of preferences over combinatorial domains, compact representation languages are needed to ...
Incompleteness and incomparability in preference aggregation: Complexity results
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference relations over possible candidates. The set of preference relations of an agent may be incomplete because, for ...
Aggregating multi-valued CP-nets: a CSP-based approach
We develop a framework for preference aggregation in multi-attribute, multi-valued domains, where agents' preferences are represented by Conditional Preference Networks (CP-nets). Most existing work either does not consider computational requirements, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- General Chairs:
- Edith Elkind,
- Manuela Veloso,
- Program Chairs:
- Noa Agmon,
- Matthew E. Taylor
Sponsors
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- European H2020 project NoAW
- European H2020 GLOPACK
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 24Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in