Algorithms for two variants of Satisfaction Approval Voting

TL;DR

This paper demonstrates that the winning set for two variants of Satisfaction Approval Voting can be computed efficiently in polynomial time, advancing understanding of computational aspects of approval-based multi-winner voting rules.

Contribution

It provides polynomial-time algorithms for determining winners in two natural variants of Satisfaction Approval Voting, which were previously unresolved.

Findings

Winning set can be computed in polynomial time for two SAV variants

Advances computational understanding of approval voting rules

Addresses open problems suggested at a social choice workshop

Abstract

Multi-winner voting rules based on approval ballots have received increased attention in recent years. In particular Satisfaction Approval Voting (SAV) and its variants have been proposed. In this note, we show that the winning set can be determined in polynomial time for two prominent and natural variants of SAV. We thank Arkadii Slinko for suggesting these problems in a talk at the Workshop on Challenges in Algorithmic Social Choice, Bad Belzig, October 11, 2014.