Pages that link to "Item:Q646535"
From MaRDI portal
The following pages link to Incompleteness and incomparability in preference aggregation: complexity results (Q646535):
Displaying 16 items.
- A Borda count for collective sentiment analysis (Q314431) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Incompleteness and incomparability in preference aggregation: complexity results (Q646535) (← links)
- On the modelling and optimization of preferences in constraint-based temporal reasoning (Q646549) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies (Q969536) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- On the evaluation of election outcomes under uncertainty (Q1761297) (← links)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
- Distributed monitoring of election winners (Q2289007) (← links)
- Optimizing positional scoring rules for rank aggregation (Q2321258) (← links)
- Bribery in voting with CP-nets (Q2436697) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules (Q3182918) (← links)
- Comparing machine learning algorithms by union-free generic depth (Q6570318) (← links)
