Pages that link to "Item:Q464615"

The following pages link to Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615):

Displaying 12 items.

• A Borda count for collective sentiment analysis (Q314431) (← links)
• New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
• Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
• Is computational complexity a barrier to manipulation? (Q656822) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
• Byzantine preferential voting (Q2190409) (← links)
• Distance restricted manipulation in voting (Q2235758) (← links)
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)
• Bounded incentives in manipulating the probabilistic serial rule (Q6142601) (← links)