STV和具有平行论域抢七的排序对的实用算法
Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking
摘要:
STV和排序对(RP)是两个研究得很好的群体决策的投票规则。他们在多轮中进行,并受到每一轮中关系如何打破的影响。然而,关于如何打破联系,文献却令人惊讶地模糊不清。我们提出了第一个算法,用于计算的替代品,是赢家在一些抢七机制下STV和RP,这也被称为平行宇宙抢七(PUT)。不幸的是,在STV和RP下计算PUT获胜者是NP完全的,并且AI的标准搜索算法不适用。我们提出了多种基于DFS的算法,以及修剪策略和算法来优先考虑搜索方向,以显着提高性能,使用机器学习。我们还提出了新的ILP配方的PUT赢家根据STV和RP,分别。合成和真实世界的数据上的实验表明,我们的算法是整体显着快于ILP,而有几种情况下,ILP是显着更快的RP。
英文摘要:
STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague about how ties should be broken. We propose the first algorithms for computing the set of alternatives that are winners under some tiebreaking mechanism under STV and RP, which is also known as parallel-universes tiebreaking (PUT). Unfortunately, PUT-winners are NP-complete to compute under STV and RP, and standard search algorithms from AI do not apply. We propose multiple DFS-based algorithms along with pruning strategies and heuristics to prioritize search direction to significantly improve the performance using machine learning. We also propose novel ILP formulations for PUT-winners under STV and RP, respectively. Experiments on synthetic and real-world data show that our algorithms are overall significantly faster than ILP, while there are a few cases where ILP is significantly faster for RP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。