AINeutralarXiv – CS AI · 9h ago5/10
🧠
Computing Thiele Rules on Interval Elections and their Generalizations
Researchers resolve a long-standing open question in computational social choice by proving that Thiele rules, particularly Proportional Approval Voting, can be computed in polynomial time on the voter interval domain despite the constraint matrix not being totally unimodular. The breakthrough extends to more general domains (VCI and LC) and establishes that the LC domain strictly contains the VCI domain.