Pages that link to "Item:Q1959429"

The following pages link to Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429):

Displaying 27 items.

• Ranking chain sum orders (Q290525) (← links)
• On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
• Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
• Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
• How hard is it to tell which is a Condorcet committee? (Q459394) (← links)
• Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
• Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
• Selections from ordered sets (Q1638034) (← links)
• Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
• On the evaluation of election outcomes under uncertainty (Q1761297) (← links)
• The possible winner problem with uncertain weights revisited (Q2140520) (← links)
• Weighted partial order oriented three-way decisions under score-based common voting rules (Q2191250) (← links)
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
• Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
• Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
• Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
• The complexity of online manipulation of sequential elections (Q2637642) (← links)
• On the exact amount of missing information that makes finding possible winners hard (Q2698287) (← links)
• COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
• Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
• Balanced stable marriage: how close is close enough? (Q5918373) (← links)
• The possible winner with uncertain weights problem (Q6133655) (← links)
• Complexity of conformant election manipulation (Q6546592) (← links)