In a committee election, a set of candidates has to be determined as winner of the election. Baumeister and Dennisen [2] proposed to extend the minisum and ...

In a committee election, a set of candidates has to be deter- mined as winner of the election. Baumeister and Dennisen [2] proposed to extend the minisum and ...

Sep 27, 2015 · Abstract. In a committee election, a set of candidates has to be determined as winner of the election. Baumeister and Dennisenï ź[2] proposed to ...

It is shown that winner determination is possible in polynomial time for all minisum rules the authors consider, whereas it is $$\mathrm{NP}$$-complete for ...

In committee elections it is often assumed that voters only (dis)approve of each candidate or that they rank all candidates, as it is common for single-winner ...

PDF | Minimax is a recently proposed procedure for electing committees, but it cannot be applied without an understanding of its computational.

21 References ; Winner Determination and Manipulation in Minisum and Minimax Committee Elections · Dorothea BaumeisterSophie DennisenLisa Rey. Mathematics.

It ensures that no voter is “too far away” from the committee that is elected—based on proximity-weighted Hamming distances—whereas minisum outcomes ensure that ...

There has been a long line of research in the computational study of elections on the complexity of manipulative actions such as manipulation and bribery. These ...

We define a family of rules for approval-based voting on combinatorial domains, where voters cast conditional approval ballots, al- lowing them to approve ...