Abstract:
In this thesis, we study the complexity of bribery and manipulation in the setting known as voting-rule uncertainty, where the attacker does not know which of a set of voting rules will be used but wants their attack to succeed regardless of which voting rule from the set is used. Our study is in the manipulative-attack framework known as the nonunique-winner model. We show that knowing the easiness or hardness of bribery for each of two rules does not determine the complexity of bribery for their joint use as an uncertain pair. We then provide results on constructive control by adding voters in the voting-rule uncertainty setting
${k_1\hbox{-}\Approval,\ldots,k_x\hbox{-}\Approval,l_1\hbox{-}\Veto,\ldots,l_y\hbox{-}\Veto}$