IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-04405495.html
   My bibliography  Save this paper

The impossibility of non-manipulable probability aggregation

Author

Listed:
  • Franz Dietrich

    (CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Christian List

    (LMU - Fakultät für Physik - Ludwig-Maximilians-Universität [München/Munich] - LMU - Ludwig-Maximilians University [Munich])

Abstract

A probability aggregation rule assigns to each profile of probability functions across a group of individuals (representing their individual probability assignments to some propositions) a collective probability function (representing the group's probability assignment). The rule is "non-manipulable" if no group member can manipulate the collective probability for any proposition in the direction of his or her own probability by misrepresenting his or her probability function ("strategic voting"). We show that, except in trivial cases, no probability aggregation rule satisfying two mild conditions (non-dictatorship and consensus preservation) is non-manipulable.

Suggested Citation

  • Franz Dietrich & Christian List, 2024. "The impossibility of non-manipulable probability aggregation," Post-Print halshs-04405495, HAL.
    • Handle: RePEc:hal:journl:halshs-04405495
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-04405495
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-04405495/document
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
    2. Dokow, Elad & Holzman, Ron, 2010. "Aggregation of binary evaluations," Journal of Economic Theory, Elsevier, vol. 145(2), pages 495-511, March.
    3. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    Full references (including those not matched with items on IDEAS)

    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. James Schummer, 1999. "Almost-dominant Strategy Implementation," Discussion Papers 1278, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Souvik Roy & Soumyarup Sadhukhan, 2019. "A characterization of random min–max domains and its applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(4), pages 887-906, November.
    3. Freixas, Josep & Parker, Cameron, 2015. "Manipulation in games with multiple levels of output," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 144-151.
    4. Roy, Souvik & Storcken, Ton, 2019. "A characterization of possibility domains in strategic voting," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 46-55.
    5. Michel Breton & Vera Zaporozhets, 2009. "On the equivalence of coalitional and individual strategy-proofness properties," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(2), pages 287-309, August.
    6. Chatterjee, Swarnendu & Peters, Hans & Storcken, Ton, 2016. "Locating a public good on a sphere," Economics Letters, Elsevier, vol. 139(C), pages 46-48.
    7. Arribillaga, R. Pablo & Bonifacio, Agustín G., 2024. "Obvious manipulations of tops-only voting rules," Games and Economic Behavior, Elsevier, vol. 143(C), pages 12-24.
    8. M. Sanver, 2009. "Strategy-proofness of the plurality rule over restricted domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(3), pages 461-471, June.
    9. Sanver, M. Remzi, 2008. "Nash implementability of the plurality rule over restricted domains," Economics Letters, Elsevier, vol. 99(2), pages 298-300, May.
    10. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2010. "Individual versus group strategy-proofness: When do they coincide?," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1648-1674, September.
    11. Ehlers, Lars & Peters, Hans & Storcken, Ton, 2004. "Threshold strategy-proofness: on manipulability in large voting problems," Games and Economic Behavior, Elsevier, vol. 49(1), pages 103-116, October.
    12. Shin Sato, 2010. "Circular domains," Review of Economic Design, Springer;Society for Economic Design, vol. 14(3), pages 331-342, September.
    13. Shurojit Chatterji & Arunava Sen, 2011. "Tops-only domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 46(2), pages 255-282, February.
    14. Shin Sato, 2012. "On strategy-proof social choice under categorization," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 455-471, March.
    15. Alexander Reffgen, 2011. "Generalizing the Gibbard–Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 37(1), pages 39-59, June.
    16. Salvador Barbera & Matthew Jackson, 1991. "A Characterization of Strategy-Proof Social Choice Functions for Economies with Pure Public Goods," Discussion Papers 964, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. X. Ruiz del Portal, 2012. "Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types," Review of Economic Design, Springer;Society for Economic Design, vol. 16(4), pages 311-321, December.
    18. Block, Veronica, 2010. "Efficient and strategy-proof voting over connected coalitions: A possibility result," Economics Letters, Elsevier, vol. 108(1), pages 1-3, July.
    19. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2020. "Arrow on domain conditions: a fruitful road to travel," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(2), pages 237-258, March.
    20. Le Breton, Michel & Weymark, John A., 1999. "Strategy-proof social choice with continuous separable preferences," Journal of Mathematical Economics, Elsevier, vol. 32(1), pages 47-85, August.

    More about this item

    JEL classification:

    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D8 - Microeconomics - - Information, Knowledge, and Uncertainty

    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:hal:journl:halshs-04405495. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.