IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i23p4418-d982058.html
   My bibliography  Save this article

An Aggregation Rule Based on the Binomial Distribution

Author

Listed:
  • Josep Freixas

    (Departament de Matemàtiques, Universitat Politècnica de Catalunya, 08243 Manresa, Spain)

Abstract

Many decision-making situations require the evaluation of several voters or agents. In a situation where voters evaluate candidates, the question arises of how best to aggregate evaluations so as to compare the candidates. The aim of this work is to propose a method of aggregating the evaluations of the voters, which has outstanding properties and serve as a potential evaluative tool in many contexts. Ordered weighted averages is a family of rules appropriate for studying this problem. In this paper, I propose as a solution an ordered weighted average that satisfies compelling properties and whose weights are derived from the binomial distribution.

Suggested Citation

  • Josep Freixas, 2022. "An Aggregation Rule Based on the Binomial Distribution," Mathematics, MDPI, vol. 10(23), pages 1-14, November.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4418-:d:982058
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4418/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/23/4418/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Macé, Antonin, 2018. "Voting with evaluations: Characterizations of evaluative voting and range voting," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 10-17.
    2. Freixas, Josep & Parker, Cameron, 2015. "Manipulation in games with multiple levels of output," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 144-151.
    3. H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
    4. Michel Balinski & Rida Laraki, 2011. "Majority Judgment: Measuring, Ranking, and Electing," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262015137, December.
    5. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
    6. Fuad Aleskerov & Vyacheslav Chistyakov & Valery Kalyagin, 2010. "Social threshold aggregations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 35(4), pages 627-646, October.
    7. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    8. Aleskerov, Fuad & Chistyakov, Vyacheslav V. & Kalyagin, Valery, 2010. "The threshold aggregation," Economics Letters, Elsevier, vol. 107(2), pages 261-262, May.
    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. Aleskerov, Fuad & Karabekyan, Daniel & Sanver, M. Remzi & Yakuba, Vyacheslav, 2012. "On the manipulability of voting rules: The case of 4 and 5 alternatives," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 67-73.
    2. Erdamar, Bora & Sanver, M. Remzi & Sato, Shin, 2017. "Evaluationwise strategy-proofness," Games and Economic Behavior, Elsevier, vol. 106(C), pages 227-238.
    3. Karabekyan, D., 2022. "On the stability of results for aggregation procedures," Journal of the New Economic Association, New Economic Association, vol. 57(5), pages 24-37.
    4. James Schummer, 1999. "Almost-dominant Strategy Implementation," Discussion Papers 1278, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    5. 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.
    6. Freixas, Josep & Parker, Cameron, 2015. "Manipulation in games with multiple levels of output," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 144-151.
    7. Roy, Souvik & Storcken, Ton, 2019. "A characterization of possibility domains in strategic voting," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 46-55.
    8. 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.
    9. 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.
    10. 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.
    11. Sanver, M. Remzi, 2008. "Nash implementability of the plurality rule over restricted domains," Economics Letters, Elsevier, vol. 99(2), pages 298-300, May.
    12. 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.
    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.

    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:gam:jmathe:v:10:y:2022:i:23:p:4418-:d:982058. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.