The number of Arrovian constitutions, when N agents are to rank n alternatives, is p(n)p(n)N, where p(n) is the number of weak orderings of n alternatives. For n≤15, p(n) is the nearest integer to n!/2(log2)n+1, the dominant term of a series derived by contour integration of the generating function. For large n, about n/17 additional terms in the series suffice to compute p(n) exactly.
Unable to display preview. Download preview PDF.