Condorcet Jury Theorem

Published by Mario Oettler on

Last Updated on 28. April 2023 by Martin Schuster

The Condorcet Jury theorem answers the question under which circumstances a binary group decision comes to a better conclusion than the decision of a single individual.

For that purpose, we assume:

  • A jury has to decide between option A and option B.
  • The jury consists of k members, whereas k > 2 and odd.
  • Every jury member is likely to choose the better option with a probability of q.
  • The jury decides with an absolute majority.

If q is > 0.5, the likelihood that the jury chooses the better option increases with the number of jury members. The following two charts show the increasing likelihood for q = 0.51 and 0.7 depending on the jury size.

Development of the likelihood that the jury’s decision is correct at q  = 0.51, depending on the jury size.
Development of the likelihood that the jury’s decision is correct at q  = 0.7, depending on the jury size.
Categories:

https://blockchain-academy.hs-mittweida.de/wp-content/uploads/2021/04/logo_bcam_rgb_gross.png

Welcome

Blockchain Academy

Continue with credential

No account yet?

Powered by Hidy

Register with Hidy


Register
Sign in

We need the following credential to register:

please select:

To create a new account, we need the following data from you:

We would appreciate the following additional information from you for the creation of your account:

Welcome

Blockchain Academy

Continue with credential

Already have an account?

Powered by Hidy

Sign in with Hidy


Register
Sign in

We need the following credential to log in:

please select:
Do you need assistance?
Click here to open chat.

Privacy Notice: This chat sends your questions to an external AI server.
How can we help you?
  • Please note: All questions, chat history, and feedback are sent to an external AI server for processing. Do not share sensitive personal information.

    All responses are generated by AI. Independently verify and fact-check all information before use.
  • No Chat History yet, start talking...