选举地图
Map of Elections
AI总结:
本文提出选举地图框架,用位置距离衡量选举相似性并在二维空间可视化,实验验证其准确可信,并通过着色辅助分析实验结果。
摘要:
我们的主要贡献是引入了选举地图框架。一幅选举地图包含三个主要元素:(1)选举数据集(即给定候选人集合上的序数投票集合),(2)衡量这些选举之间相似性的方法,以及(3)将选举表示为二维欧几里得空间中的点,使得两个选举越相似,它们的点就越接近。在我们的地图中,我们主要关注合成选举数据集,但也展示了一个基于真实选举的地图示例。为了衡量相似性,我们本倾向于使用同构交换距离等度量,但由于其高计算复杂度而不可行。因此,我们提出了多项式时间可计算的位置距离(positionwise distance)并加以使用。关于二维欧几里得空间中的表示,我们主要使用Kamada-Kawai算法,但也展示了两种替代方案。我们发展了构建地图所需的理论结果,并通过实验论证了这些地图的准确性和可信度。此外,我们展示了如何根据各种标准对地图中的选举进行着色,以帮助分析大量实验的结果。特别地,我们展示了根据获胜候选人或委员会的得分、基于ILP的获胜者确定算法的运行时间以及特定算法实现的近似比进行的着色。
英文摘要:
Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of ordinal votes over given sets of candidates), (2) a way of measuring similarities between these elections, and (3) a representation of the elections in the 2D Euclidean space as points, so that the more similar two elections are, the closer are their points. In our maps, we mostly focus on datasets of synthetic elections, but we also show an example of a map over real-life ones. To measure similarities, we would have preferred to use, e.g., the isomorphic swap distance, but this is infeasible due to its high computational complexity. Hence, we propose polynomial-time computable positionwise distance and use it instead. Regarding the representations in 2D Euclidean space, we mostly use the Kamada-Kawai algorithm, but we also show two alternatives. We develop the necessary theoretical results to form our maps and argue experimentally that they are accurate and credible. Further, we show how coloring the elections in a map according to various criteria helps in analyzing results of a number of experiments. In particular, we show colorings according to the scores of winning candidates or committees, running times of ILP-based winner determination algorithms, and approximation ratios achieved by particular algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。