Multi-Round Vote Elicitation for Manipulation under Candidate Uncertainty

Manipulation becomes harder when manipulators are uncertain about the preferences of sincere voters. Elicitation may communicate information, of sincere voters' votes, to a manipulator, allowing him to vote strategically. In this paper, a multi-round elicitation process, of sincere voters' preferences, is derived that yields to an optimal manipulation with minimal information elicited. Through in-depth experimental study, this paper answers the question: How many candidates, per sincere voter, are needed to be known for an optimal manipulation? Probabilistic models such as IC and SP-IC are used to complete preference profiles.