IDEAS home Printed from https://ideas.repec.org/a/cup/ecnphi/v23y2007i03p269-300_00.html

Strategy-Proof Judgment Aggregation

Author

Listed:
  • DIETRICH, FRANZ
  • LIST, CHRISTIAN

Abstract

Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than “premise-based voting”, which is strategy-proof only for “reason-oriented” individuals. Surprisingly, for “outcome-oriented” individuals, the two rules are strategically equivalent, generating identical judgments in equilibrium. Our results introduce game-theoretic considerations into judgment aggregation and have implications for debates on deliberative democracy.

Suggested Citation

  • Dietrich, Franz & List, Christian, 2007. "Strategy-Proof Judgment Aggregation," Economics and Philosophy, Cambridge University Press, vol. 23(3), pages 269-300, November.
    • Handle: RePEc:cup:ecnphi:v:23:y:2007:i:03:p:269-300_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S0266267107001496/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    JEL classification:

    • J1 - Labor and Demographic Economics - - Demographic Economics

    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:cup:ecnphi:v:23:y:2007:i:03:p:269-300_00. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/eap .

    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.