Determining Possible and Necessary Winners Given Partial Orders

by   Lirong Xia, et al.

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial orders instead. Then, given a voting rule, a profile of partial orders, and an alternative (candidate) c, two important questions arise: first, is it still possible for c to win, and second, is c guaranteed to win? These are the possible winner and necessary winner problems, respectively. Each of these two problems is further divided into two sub-problems: determining whether c is a unique winner (that is, c is the only winner), or determining whether c is a co-winner (that is, c is in the set of winners). We consider the setting where the number of alternatives is unbounded and the votes are unweighted. We completely characterize the complexity of possible/necessary winner problems for the following common voting rules: a class of positional scoring rules (including Borda), Copeland, maximin, Bucklin, ranked pairs, voting trees, and plurality with runoff.


page 1

page 2

page 3

page 4


The Complexity of Determining the Necessary and Possible Top-k Winners in Partial Voting Profiles

When voter preferences are known in an incomplete (partial) manner, winn...

Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences

Lu and Boutilier proposed a novel approach based on "minimax regret" to ...

Trustworthy Preference Completion in Social Choice

As from time to time it is impractical to ask agents to provide linear o...

Computing the Extremal Possible Ranks with Incomplete Preferences

In an election via a positional scoring rule, each candidate receives fr...

Label Ranking with Abstention: Predicting Partial Orders by Thresholding Probability Distributions (Extended Abstract)

We consider an extension of the setting of label ranking, in which the l...

Sequential Voting with Confirmation Network

We discuss voting scenarios in which the set of voters (agents) and the ...

Who won? Winner Determination and Robustness in Liquid Democracy

Liquid democracy is a decision-making paradigm in which each agent can e...