122 citations · 256 across the 36 of their papers we have counts for
43 papers
How Similar Are Two Elections?
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko +3
We introduce and study isomorphic distances between ordinal elections (with the same numbers of candidates and voters). The main feature of these distances is that they are invaria…
Drawing a Map of Elections
Stanisław Szufa, Niclas Boehmer, Robert Bredereck +5
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 or…
A hidden Condorcet domain in Loday's realisation of the associahedron
Arkadii Slinko
We prove that Loday's polytopal realisation of the nth Tamari lattice T_n, called associahedron, has 2^{n-1} common points with the permutohedron, which form a maximal never-middle…
A composition of Condorcet domains
Dominic Keehan, Arkadii Slinko
Inspecting known maximal Condorcet domains on 4 variables classified by Tobias Dittrich we find that 9 out of 18 of them are created using a certain composition of smaller domains.…
A combinatorial representation of Arrow's single-peaked domains
Arkadii Slinko
The most studied class of Condorcet domains (acyclic sets of linear orders) is the class of peak-pit domains of maximal width. It has a number of combinatorial representations by s…
A family of Condorcet domains that are single-peaked on a circle
Arkadii Slinko
Fishburn's alternating scheme domains occupy a special place in the theory of Condorcet domains. Karpov (2023) generalised these domains and made an interesting observation proving…