Skip to main content
Log in

Generating random weak orders and the probability of a Condorcet winner

  • Published:
Social Choice and Welfare Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 6 April 2000/Accepted: 31 January 2001

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003550100129

Keywords

Navigation