@inproceedings{084cdb7f3064456c930d494830fd8b6f,
title = "Isomorphic distances among elections",
abstract = "This paper is an invitation to study the problem of measuring distances between elections, for the case where both the particular names of the candidates and the voters are irrelevant. In other words, we say that two elections are at distance zero (or, that they are isomorphic) if it is possible to make them identical by renaming their candidates and voters, and we are interested in measuring how far are two given elections from being isomorphic. The study of such distances has just begun and in this paper we outline why we believe that it is interesting and what are the natural research directions.",
keywords = "Complexity, Distances, Elections, Isomorphism",
author = "Piotr Faliszewski and Piotr Skowron and Arkadii Slinko and Stanis{\l}aw Szufa and Nimrod Talmon",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.; 15th International Computer Science Symposium in Russia, CSR 2020 ; Conference date: 29-06-2020 Through 03-07-2020",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-50026-9_5",
language = "English",
isbn = "9783030500252",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "64--78",
editor = "Henning Fernau",
booktitle = "Computer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings",
address = "Germany",
}