AI researchers solve NP-hard Thiele rules computation for interval elections

Researchers have developed a new algorithm for computing Thiele rules in social choice theory, specifically addressing the voter interval (VI) domain which was previously an open question. The algorithm leverages a linear program that, despite not having a totally unimodular matrix, guarantees an integral solution. This technique is extended to the voter-candidate interval (VCI) and linearly consistent (LC) domains, with new insights into their relationship and definitions. AI

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

RANK_REASON Academic paper presenting a new algorithm and theoretical results in social choice theory. [lever_c_demoted from research: ic=1 ai=0.4]

Read on arXiv cs.AI →

• arXiv
• Thiele rules
• Proportional Approval Voting
• PAV
• candidate interval
• voter interval
• voter-candidate interval
• 1-dimensional voter-candidate range
• LC domain
• VCI domain

• paper
• other