@article{Faliszewski_Skowron_Slinko_Szufa_Talmon_2019, title={How Similar Are Two Elections?}, volume={33}, url={https://ojs.aaai.org/index.php/AAAI/article/view/4017}, DOI={10.1609/aaai.v33i01.33011909}, abstractNote={<p>We introduce the ELECTION ISOMORPHISM problem and a family of its approximate variants, which we refer to as <em>d</em>ISOMORPHISM DISTANCE (<em>d</em>-ID) problems (where <em>d</em> is a metric between preference orders). We show that ELECTION ISOMORPHISM is polynomial-time solvable, and that the <em>d</em>-ISOMORPHISM DISTANCE problems generalize various classic rank-aggregation methods (e.g., those of Kemeny and Litvak). We establish the complexity of our problems (including their inapproximability) and provide initial experiments regarding the ability to solve them in practice.</p>}, number={01}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Faliszewski, Piotr and Skowron, Piotr and Slinko, Arkadii and Szufa, Stanisław and Talmon, Nimrod}, year={2019}, month={Jul.}, pages={1909-1916} }