The number of weak orderings of a finite set

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\leq15, 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.

MoreLess

Year of publication:	1998-08-06
Authors:	Bailey, Ralph W.
Published in:	Social Choice and Welfare. - Springer. - Vol. 15.1998, 4, p. 559-562
Publisher:	Springer

More details

Extent:	application/pdf application/postscript
Type of publication:	Article
Notes:	Received: 29 May 1995 / Accepted: 22 May 1997
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005369376