发表机构
Hasso Plattner Institute, University of Potsdam（波茨坦大学哈索·普拉特纳研究所）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文证明在基于批准的多人投票中，同时满足正当代表和帕累托最优的委员会计算是NP难的，否定回答了相关开放问题。
AI 中文摘要
基于批准的多人投票中的一个开放问题涉及我们能否高效计算同时满足正当代表和帕累托最优的委员会。我们通过证明在所有配置文件的域上，输出满足这两个公理的委员会是NP难的，来否定地回答这个问题。初始证明由ChatGPT Astra发现，随后由作者验证并重写。
英文摘要
An open problem in approval-based multiwinner voting concerns whether we can efficiently compute committees that satisfy both justified representation and Pareto optimality. We answer this question negatively by proving that, on the domain of all profiles, outputting a committee satisfying both axioms is NP-hard. An initial proof was found by ChatGPT Astra. This was then verified and rewritten by the author.
Comments6 pages
