IDEAS home Printed from https://ideas.repec.org/p/cla/levarc/122247000000002422.html
   My bibliography  Save this paper

Condorcet Jury Theorem: The Dependent Case

Author

Listed:
  • Bezalel Peleg
  • Shmuel Zamir

Abstract

We provide an extension of the Condorcet Theorem. Our model includes both the Nitzan-Paroush framework of “unequal competencies” and Ladha’s model of “correlated voting by the jurors”. We assume that the jurors behave “informatively”, that is, they do not make a strategic use of their information in voting. Formally, we consider a sequence of binary random variables X = (X 1 ,X 2 , ...,X n , ...) with range in {0,1} and a joint probability distribution P. The pair (X,P) is said to satisfy the Condorcet Jury Theorem (CJT) if lim n→∞ P(∑X i >n/2)=1. For a general (dependent) distribution P we provide necessary as well as sufficient conditions for the CJT. Let p i = E(X i ), p n = (p 1 + p 2 , ...+ p n )/n and X n = (X 1 +X 2 , ...+X n )/n. A consequence of our results is that the CJT is satisfied if lim√n( p n -1/2)=∞ and ∑ i ∑ j≠i Cov(X i ,X j ) ≤ 0 for n > N 0 . The importance of this result is that it establishes the validity of the CJT for a domain which strictly (and naturally) includes the domain of independent jurors. Given (X,P), let p = liminf p n , and p = limsup p n . Let y = liminf E( X n - p n ) 2 , y * = liminf E| X n - p n | and y * = limsup E| X n - p n |. Necessary conditions for the CJT are that p ≥1/2 + 1/2 y ∗ , p ≥ 1/2 + y , and also p ≥ 1/2 + y ∗ . We exhibit a large family of distributions P with liminf 1/n(n-1) ∑ i ∑ j≠i Cov(X i ,X j ) > 0 which satisfy the CJT. We do that by ‘interlacing’ carefully selected pairs (X,P) and (X′,P′). We then proceed to project the distributions P on the planes ( p , y ∗ ) and ( p , y ), and determine all feasible points in each of these planes. Quite surprisingly, many important results on the possibility of the CJT are obtained by analyzing various regions of the feasible set in these planes.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Bezalel Peleg & Shmuel Zamir, 2008. "Condorcet Jury Theorem: The Dependent Case," Levine's Working Paper Archive 122247000000002422, David K. Levine.
    • Handle: RePEc:cla:levarc:122247000000002422
    as

    Download full text from publisher

    File URL: http://www.dklevine.com/archive/refs4122247000000002422.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Daniel Berend & Jacob Paroush, 1998. "When is Condorcet's Jury Theorem valid?," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 15(4), pages 481-488.
    2. Austen-Smith, David & Banks, Jeffrey S., 1996. "Information Aggregation, Rationality, and the Condorcet Jury Theorem," American Political Science Review, Cambridge University Press, vol. 90(1), pages 34-45, March.
    3. Myerson, Roger B., 1998. "Extended Poisson Games and the Condorcet Jury Theorem," Games and Economic Behavior, Elsevier, vol. 25(1), pages 111-131, October.
    4. Ladha, Krishna K., 1995. "Information pooling through majority-rule voting: Condorcet's jury theorem with correlated votes," Journal of Economic Behavior & Organization, Elsevier, vol. 26(3), pages 353-372, May.
    5. Jean-François Laslier & Jörgen Weibull, 2008. "Committee decisions: Optimality and Equilibrium," Working Papers halshs-00121741, HAL.
    6. Roger B. Myerson, 1998. "Population uncertainty and Poisson games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 375-392.
    7. Wit, Jorgen, 1998. "Rational Choice and the Condorcet Jury Theorem," Games and Economic Behavior, Elsevier, vol. 22(2), pages 364-376, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander Zaigraev & Serguei Kaniovski, 2012. "Bounds on the competence of a homogeneous jury," Theory and Decision, Springer, vol. 72(1), pages 89-112, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bezalel Peleg & Shmuel Zamir, 2009. "On Bayesian-Nash Equilibria Satisfying the Condorcet Jury Theorem: The Dependent Case," Discussion Paper Series dp527, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    2. Hummel, Patrick, 2011. "Information aggregation in multicandidate elections under plurality rule and runoff voting," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 1-6, July.
    3. Patrick Hummel, 2012. "Deliberation in large juries with diverse preferences," Public Choice, Springer, vol. 150(3), pages 595-608, March.
    4. Alexander Lundberg, 2020. "The importance of expertise in group decisions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(3), pages 495-521, October.
    5. Bezalel Peleg & Shmuel Zamir, 2012. "Extending the Condorcet Jury Theorem to a general dependent jury," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(1), pages 91-125, June.
    6. Sourav Bhattacharya, 2006. "Preference Monotonicity and Information Aggregation in Elections," Working Paper 325, Department of Economics, University of Pittsburgh, revised Dec 2008.
    7. Triossi, Matteo, 2013. "Costly information acquisition. Is it better to toss a coin?," Games and Economic Behavior, Elsevier, vol. 82(C), pages 169-191.
    8. Adam Meirowitz, 2007. "In Defense of Exclusionary Deliberation: Communication and Voting with Private Beliefs and Values," Journal of Theoretical Politics, , vol. 19(3), pages 301-327, July.
    9. Ruth Ben-Yashar, 2006. "Information is important to Condorcet jurors," Public Choice, Springer, vol. 127(3), pages 305-319, June.
    10. Ruth Ben-Yashar & Shmuel Nitzan, 2017. "Is diversity in capabilities desirable when adding decision makers?," Theory and Decision, Springer, vol. 82(3), pages 395-402, March.
    11. Laurent Bouton & Micael Castanheira, 2012. "One Person, Many Votes: Divided Majority and Information Aggregation," Econometrica, Econometric Society, vol. 80(1), pages 43-87, January.
    12. Myerson, Roger, 1999. "Informational origins of political bias towards critical groups of voters," European Economic Review, Elsevier, vol. 43(4-6), pages 767-778, April.
    13. Jerome Mathis, 2006. "Deliberation with Partially Verifiable Information," THEMA Working Papers 2006-03, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    14. Venturini, Andrea, 2015. "Strategic Voting with Almost Perfect Signals," MPRA Paper 71216, University Library of Munich, Germany.
    15. Duggan, John & Martinelli, Cesar, 2001. "A Bayesian Model of Voting in Juries," Games and Economic Behavior, Elsevier, vol. 37(2), pages 259-294, November.
    16. Bilge Yilmaz, "undated". "Strategic Voting and Proxy Contests," Rodney L. White Center for Financial Research Working Papers 05-00, Wharton School Rodney L. White Center for Financial Research.
    17. Hans Gersbach, 2002. "Democratic Mechanisms: Double Majority Rules and Flexible Agenda Costs," CESifo Working Paper Series 749, CESifo.
    18. Ruth Ben-Yashar & Igal Milchtaich, 2003. "First and Second Best Voting Rules in Committees," Working Papers 2003-08, Bar-Ilan University, Department of Economics.
    19. Matteo Triossiv, 2010. "Costly information acquisition. Better to toss a coin?," Documentos de Trabajo 267, Centro de Economía Aplicada, Universidad de Chile.
    20. Mandler, Michael, 2012. "The fragility of information aggregation in large elections," Games and Economic Behavior, Elsevier, vol. 74(1), pages 257-268.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cla:levarc:122247000000002422. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.