The number of weak orderings of a finite set
From MaRDI portal
Publication:2386294
DOI10.1007/s003550050123zbMath1066.91527MaRDI QIDQ2386294
Publication date: 22 August 2005
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003550050123
91B14: Social choice
Related Items
A lower bound for Cusick’s conjecture on the digits of n + t, The number of preference orderings: a recursive approach, Generating Gray codes for weak orders in constant amortized time, Counting combinatorial choice rules, Random preorders and alignments, Social choice rules with vetoers, Applications of Apostol-type numbers and polynomials: approach to techniques of computation algorithms in approximation and interpolation functions, Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner, On representations of ternary order relations in numeric strings