Pages that link to "Item:Q3007558"

The following pages link to Determining Possible and Necessary Winners Given Partial Orders (Q3007558):

Displaying 32 items.

• Ranking chain sum orders (Q290525) (← links)
• Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
• New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
• Reaching a joint decision with minimal elicitation of voter preferences (Q506745) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• A distributed social choice protocol for combinatorial domains (Q524881) (← links)
• Verification in incomplete argumentation frameworks (Q668774) (← links)
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
• On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
• Manipulative elicitation -- a new attack on elections with incomplete preferences (Q1637215) (← links)
• Fixing balanced knockout and double elimination tournaments (Q1711876) (← links)
• Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
• Complexity of manipulation with partial information in voting (Q1743720) (← links)
• Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
• On the evaluation of election outcomes under uncertainty (Q1761297) (← links)
• Robust winner determination in positional scoring rules with uncertain weights (Q1986068) (← links)
• A parameterized perspective on protecting elections (Q2034407) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← 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)
• Local distance constrained bribery in voting (Q2215965) (← links)
• Approximation and hardness of shift-Bribery (Q2238694) (← links)
• Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
• Distributed monitoring of election winners (Q2289007) (← links)
• Optimizing positional scoring rules for rank aggregation (Q2321258) (← links)
• Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
• Bribery in voting with CP-nets (Q2436697) (← links)
• On the exact amount of missing information that makes finding possible winners hard (Q2698287) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Manipulation of k-Approval Under De Re Knowledge (Q5057962) (← links)
• On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard (Q5111273) (← links)
• The possible winner with uncertain weights problem (Q6133655) (← links)