Journal Article10.1007/BF00192881
Notes on Craven's conjecture
12
TL;DR: In this paper, it was shown that the ratio of the size of the maximum satisfying set to 2n−1 approaches infinity as the number of elements in the set grows larger.
read more
Abstract: Craven's conjecture says that 2n−1 is the maximum number of linear orders on {1, 2,...n} that simultaneously satisfy certain restrictions on three-element subsets of {1, 2,...n}. This is true for n=3, but the maximum exceeds 2n−1 for n≧4. There is a set of nine linear orders on {1, 2, 3, 4} that satisfy the restrictions. As n gets large, the ratio of the size of the maximum satisfying set to 2n−1 approaches infinity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Majority-consistent preference orderings
TL;DR: In this article, the authors consider the construction of sets of preferences that give consistent outcomes under majority voting and give a characterisation of the preferences generated through these agreements and make observations on the relation between the sizes of such sets as the number of alternatives increases.
13
•Posted Content
Condorcet domains and distributive lattices
TL;DR: Condorcet domains are sets of linear orders where Condorcet's effect can never occur as mentioned in this paper, and they cover distributive sublattices of the permutoedre lattice and can be obtained from a maximal chain of this lattice.
12
Decision theory and discrete mathematics
TL;DR: The transitive simple majorities problem of determining the maximum number of linear orders on n candidates that prevent the occurrence of cyclic majorities when voters' preferences are confined to those orders is discussed.
10
Further notes on Craven's conjecture
TL;DR: In this article, the authors extend the work of Fishburn [4] and Abello and Johnson [1] by increasing lower bounds on the number of possible value-restricted preference orderings.
7
Condorcet Domains of Degree at most Seven
TL;DR: In this paper , the first explicit enumeration of all maximal Condorcet domains up to degree 7 was given, with respect to many properties studied in the social sciences and mathematical literature.