Cover Image

Generating random weak orders and the probability of a Condorcet winner

We present an algorithm for generating a random weak order of m objects in which all possible weak orders are equally likely. The form of the algorithm suggests analytic expressions for the probability of a Condorcet winner both for linear and for weak preference orders.
Year of publication:
2002-07-08
Authors: Bezembinder, Thom ; Maassen, Hans
Published in:
Social Choice and Welfare. - Springer. - Vol. 19.2002, 3, p. 517-532
Publisher: Springer
freely available
Full text |
Check Google Scholar
In German libraries (KVK)
I need help
Extent:
application/pdf
Type of publication: Article
Notes:
Received: 6 April 2000/Accepted: 31 January 2001
Source:
Persistent link: https://www.econbiz.de/10005596419
Similar items by person