Computing Thiele Rules on Interval Elections and their Generalizations

The paper addresses the computational complexity of Thiele rules in approval-based committee voting, a topic of significant interest in social choice theory. It resolves an open question regarding the voter interval domain, showing that an existing linear program approach still yields optimal solutions despite the matrix not being totally unimodular.