Towards Completing the Puzzle: Solving Open Problems for Control in Elections

Gábor Erdélyi, Christian Reger, Yongjie Yang

Abstract: We investigate the computational complexity of electoral control in elections. Electoral control describes the scenario where the election chair seeks to alter the outcome of the election by structural changes such as adding, deleting, or replacing either candidates or voters. Such control actions have been studied in the literature for a lot of prominent voting correspondences. In this paper, we complement those results by solving several open cases for Copeland$^α $, Maximin, k-Veto, Plurality with Runoff, and Veto with Runoff.