AI 中文总结
研究稳定投票和简单稳定投票规则下获胜者确定的计算复杂性，通过递归定义规则，解决了该问题，证明其获胜者确定是 PSPACE 完全问题。
AI 中文摘要
由霍利迪和帕奎特提出的稳定投票和简单稳定投票是孔多塞一致的投票规则，通过递归定义：若候选人在去除他们击败的对手后仍能获胜，且优先考虑优势最大的配对，则该候选人获胜。这些规则下获胜者确定的计算复杂性一直是个开放问题。我们解决了这个问题：稳定投票和简单稳定投票下的获胜者确定都是 PSPACE 完全问题。
英文摘要
Stable Voting and Simple Stable Voting, introduced by Holliday and Pacuit, are Condorcet-consistent voting rules defined recursively: a candidate wins if they would win after removing some opponent they beat, taking the pair with the largest margin first. The computational complexity of winner determination under these rules has been an open question. We resolve this problem: winner determination is PSPACE-complete under both Stable Voting and Simple Stable Voting.
