84 citations · 438 across the 47 of their papers we have counts for
49 papers
Improved lower bounds for the maximum size of Condorcet domains
Alexander Karpov, Klas Markstrom, Soren Riis +1
Condorcet domains are sets of linear orders with the property that, whenever voters' preferences are restricted to the domain, the pairwise majority relation (for an odd number of…
An orderly algorithm for generation of Condorcet Domains
Bei Zhou, Klas Markström
Condorcet domains are fundamental objects in the theory of majority voting; they are sets of linear orders with the property that if every voter picks a linear order from this set,…
Near Triple Arrays
Alexey Gordeev, Klas Markström, Lars-Daniel Öhman
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows…
Arrow's single peaked domains, richness, and domains for plurality and the Borda count
Klas Markström, Søren Riis, Bei Zhou
In this paper we extend the study of Arrow's generalisation of Black's single-peaked domain and connect this to domains where voting rules satisfy different versions of independenc…
Local Diversity of Condorcet Domains
Alexander Karpov, Klas Markström, Søren Riis +1
Several of the classical results in social choice theory demonstrate that in order for many voting systems to be well-behaved the set domain of individual preferences must satisfy…
CDL: A fast and flexible library for the study of permutation sets with structural restrictions
Bei Zhou, Klas Markstrōm, Søren Riis
In this paper, we introduce CDL, a software library designed for the analysis of permutations and linear orders subject to various structural restrictions. Prominent examples of th…