English
Related papers

Related papers: Counting Condorcet Domains

200 papers

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 such familiar combinatorial objects like rhombus tilings and…

Combinatorics · Mathematics 2024-12-10 Arkadii Slinko

Condorcet domains are sets of linear orders with the property that, whenever the preferences of all voters belong to this set, the majority relation has no cycles. We observe that, without loss of generality, such domain can be assumed to…

Combinatorics · Mathematics 2016-05-19 Clemens Puppe , Arkadii Slinko

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 some kind of restriction, such as being single-peaked on a…

Theoretical Economics · Economics 2024-01-23 Alexander Karpov , Klas Markström , Søren Riis , Bei Zhou

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, assuming that the number of voters is odd, and alternatives…

Discrete Mathematics · Computer Science 2025-09-26 Bei Zhou , Klas Markström

In this paper we give the first explicit enumeration of all maximal Condorcet domains on $n\leq 7$ alternatives. This has been accomplished by developing a new algorithm for constructing Condorcet domains, and an implementation of that…

Discrete Mathematics · Computer Science 2023-12-13 Dolica Akello-Egwell , Charles Leedham-Green , Alastair Litterick , Klas Markström , Søren Riis

A Condorcet domain (CD) is a collection of linear orders on a set of candidates satisfying the following property: for any choice of preferences of voters from this collection, a simple majority rule does not yield cycles. We propose a…

Combinatorics · Mathematics 2011-08-19 Vladimir I. Danilov , Alexander V. Karzanov , Gleb A. Koshevoy

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 voters) is transitive and hence a linear order. Determining…

Discrete Mathematics · Computer Science 2026-01-13 Alexander Karpov , Klas Markstrom , Soren 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 independence of irrelevant alternatives. First we report on a…

Theoretical Economics · Economics 2024-01-24 Klas Markström , Søren Riis , Bei Zhou

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 that all of them are single-picked on a circle. However, an…

Combinatorics · Mathematics 2023-10-25 Arkadii Slinko

This paper provides a combinatorial proof to show that, in the study of maximal Condorcet domains, the class of peak-pit Condorcet domains, the class of connected Condorcet domains, and the class of directly connected Condorcet domains are…

Combinatorics · Mathematics 2025-05-27 Guanhao Li

Condorcet domains are subsets of permutations arising in voting theory: regarding their permutations as preference orders on a list of candidates, one avoids Condorcet's paradox when aggregating the preferences via a simple majority…

Combinatorics · Mathematics 2025-09-25 Victor Reiner , Bridget Eileen Tenner

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. In this paper we describe this composition. We give…

Combinatorics · Mathematics 2024-12-16 Dominic Keehan , Arkadii Slinko

We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…

Computer Science and Game Theory · Computer Science 2014-10-10 Adam Clearwater , Clemens Puppe , Arkadii Slinko

In this paper, we introduce the class of bipartite peak-pit domains. This is a class of Condorcet domains which include both the classical single-peaked and single-dipped domains. Our class of domains can be used to model situations where…

Discrete Mathematics · Computer Science 2025-12-04 Alexander Karpov , Klas Markström , Søren Riis , Bei Zhou

In this note, we report on a record-breaking Condorcet domain (CD) for n=8 alternatives. We show that there exists a CD of size 224, which is optimal and essentially unique (up to isomorphism). If we consider the underlying permutations and…

Combinatorics · Mathematics 2023-07-04 Charles Leedham-Green , Klas Markström , Søren Riis

Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions represent computable…

Logic in Computer Science · Computer Science 2015-12-15 Michael A. Bukatin

Courant's theorem implies that the number of nodal domains of a Laplace eigenfunction is controlled by the corresponding eigenvalue. Over the years, there have been various attempts to find an appropriate generalization of this statement in…

Let $D$ be a bounded domain in $\mathbf C^2$ with a non-compact group of holomorphic automorphisms. Model domains for $D$ are obtained under the hypothesis that at least one orbit accumulates at a boundary point near which the boundary is…

Complex Variables · Mathematics 2008-04-18 Kaushal Verma

We extend the concept of a finite dimensional {\it holomorphic homogeneous regular} (HHR) domain and some of its properties to the infinite dimensional setting. In particular, we show that infinite dimensional HHR domains are domains of…

Complex Variables · Mathematics 2020-11-26 Cho-Ho Chu , Kang-Tae Kim , Sejun Kim

In the field of Judgment Aggrgation, a domain, that is a subset of a Cartesian power of $\{0,1\}$, is considered to reflect abstract rationality restrictions on vectors of two-valued judgments on a number of issues. We are interested in the…

Computational Complexity · Computer Science 2019-09-04 Josep Díaz , Lefteris Kirousis , Sofia Kokonezi , John Livieratos
‹ Prev 1 2 3 10 Next ›