Isomorphic distances among elections

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanisław Szufa, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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.

Original languageEnglish
Title of host publicationComputer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings
EditorsHenning Fernau
Number of pages15
ISBN (Print)9783030500252
StatePublished - 1 Jan 2020
Event15th International Computer Science Symposium in Russia, CSR 2020 - Yekaterinburg, Russian Federation
Duration: 29 Jun 20203 Jul 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12159 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Computer Science Symposium in Russia, CSR 2020
Country/TerritoryRussian Federation


  • Complexity
  • Distances
  • Elections
  • Isomorphism

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Isomorphic distances among elections'. Together they form a unique fingerprint.

Cite this