Abstract.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 6 April 2000/Accepted: 31 January 2001
Rights and permissions
About this article
Cite this article
Maassen, H., Bezembinder, T. Generating random weak orders and the probability of a Condorcet winner. Soc Choice Welfare 19, 517–532 (2002). https://doi.org/10.1007/s003550100129
Issue Date:
DOI: https://doi.org/10.1007/s003550100129