Incompleteness and incomparability in preference aggregation: complexity results
From MaRDI portal
Publication:646535
DOI10.1016/J.ARTINT.2010.11.009zbMATH Open1225.68257OpenAlexW2085523681MaRDI QIDQ646535FDOQ646535
Authors: Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh 
Publication date: 17 November 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.11.009
Recommendations
- Determining possible and necessary winners given partial orders
- Aggregating Partially Ordered Preferences
- Incomplete information and communication in voting
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
computational complexityuncertaintypreference aggregationelicitationpreference in multi-agent systems
Cites Work
- Social choice and individual values
- Handbook of social choice and welfare. Vol. 1.
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Tournament solutions and majority voting
- Manipulation of Voting Schemes: A General Result
- Single transferable vote resists strategic voting
- Incompleteness and incomparability in preference aggregation: complexity results
- Logical preference representation and combinatorial vote
- Title not available (Why is that?)
Cited In (19)
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
- Studies in Computational Aspects of Voting
- Comparing machine learning algorithms by union-free generic depth
- Some completeness results for stoppered and ranked classical preferential models
- Incomplete preference relations: An upper bound condition
- A Borda count for collective sentiment analysis
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
- Comparing multiagent systems research in combinatorial auctions and voting
- Aggregating Partially Ordered Preferences
- Incompleteness and incomparability in preference aggregation: complexity results
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- Is computational complexity a barrier to manipulation?
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- On the evaluation of election outcomes under uncertainty
- Distributed monitoring of election winners
- On the modelling and optimization of preferences in constraint-based temporal reasoning
- Optimizing positional scoring rules for rank aggregation
- Bribery in voting with CP-nets
- Stability, optimality and manipulation in matching problems with weighted preferences
This page was built for publication: Incompleteness and incomparability in preference aggregation: complexity results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646535)
