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

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

在 arXiv cs.AI 阅读 →

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

• 论文
• 其他

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →