位置矩阵及其选举的性质
Properties of Position Matrices and Their Elections
摘要:
我们研究了具有给定位置矩阵的选举的性质(在这种选举中,每个候选人在每个位置上的排名由矩阵中指定的选民数量决定)。我们证明了产生给定位置矩阵的计数选举是P-完全的。因此,均匀随机抽样这样的选举似乎具有挑战性,我们提出了一个更简单的算法,没有硬保证。接下来,我们考虑的问题,如果一个给定的矩阵可以实现的选举具有一定的结构(如单峰或组可分性)的测试。最后,我们考虑的问题,如果一个给定的位置矩阵可以实现一个孔多塞获胜者的选举。我们用实验来补充我们的理论发现。
英文摘要:
We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix). We show that counting elections that generate a given position matrix is #P-complete. Consequently, sampling such elections uniformly at random seems challenging and we propose a simpler algorithm, without hard guarantees. Next, we consider the problem of testing if a given matrix can be implemented by an election with a certain structure (such as single-peakedness or group-separability). Finally, we consider the problem of checking if a given position matrix can be implemented by an election with a Condorcet winner. We complement our theoretical findings with experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。