Related papers: Condorcet Domains of Degree at most Seven
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…
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…
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…
A Condorcet domain is a collection of linear orders which satisfy an acyclic majority relation. In this paper we describe domains as collections of directed Hamilton paths. We prove that while Black's single-peaked domains are defined by…
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…
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…
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…
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…
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…
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…
Constant-dimension subspace codes (CDCs), a special class of subspace codes, have attracted significant attention due to their applications in network coding. A fundamental research problem of CDCs is to determine the maximum number of…
The study of large Condorcet domains (CD) has been a significant area of interest in voting theory. In this paper, our goal is to search for large CDs that are hitherto unknown. With a straightforward combinatorial definition, searching for…
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…
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…
In this note, we provide a complete classification for entire area maximizing hypersurfaces having an isolated singularity. We also construct an interesting illustrated example. For area maximizing hypersurfaces over exterior domains, we…
Condorcet winning sets are a set-valued generalization of the well-known concept of a Condorcet winner. As supersets of Condorcet winning sets are always Condorcet winning sets themselves, an interesting property of preference profiles is…
The end of Moore's Law and Dennard Scaling has combined with advances in agile hardware design to foster a golden age of domain-specific acceleration. However, this new frontier of computing opportunities is not without pitfalls. As…
This doctoral thesis covers several topics related to the construction and study of maximal determinant matrices with complex entries. The first three chapters are devoted to number-theoretic tools to prove the non-solvability of Gram…
We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…
Link prediction, a foundational task in complex network analysis, has extensive applications in critical scenarios such as social recommendation, drug target discovery, and knowledge graph completion. However, existing evaluations of…