IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v58y2009i1p58-63.html
   My bibliography  Save this article

Threshold aggregation of multi-graded rankings

Author

Listed:
  • Woeginger, Gerhard J.

Abstract

A recent paper by Aleskerov et al. [Aleskerov, F., Yakuba, V., Yuzbashev, D., 2007. A 'threshold aggregation' of three-graded rankings. Mathematical Social Sciences 53, 106-110] characterizes so-called threshold aggregation rules of three-graded rankings in terms of four axioms Anonymity, Cancelation, Pareto, and Non-compensatory Threshold. In this paper we extend this result to the case of multi-graded rankings, and we provide an alternative characterization in terms of slightly weaker axioms.

Suggested Citation

  • Woeginger, Gerhard J., 2009. "Threshold aggregation of multi-graded rankings," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 58-63, July.
  • Handle: RePEc:eee:matsoc:v:58:y:2009:i:1:p:58-63
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(09)00019-5
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hillinger, Claude, 2004. "Voting and the Cardinal Aggregation of Judgments," Discussion Papers in Economics 353, University of Munich, Department of Economics.
    2. Biung-Ghi Ju, 2005. "An efficiency characterization of plurality social choice on simple preference domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 26(1), pages 115-128, July.
    3. Aleskerov, Fuad & Yakuba, Vyacheslav & Yuzbashev, Dmitriy, 2007. "A `threshold aggregation' of three-graded rankings," Mathematical Social Sciences, Elsevier, vol. 53(1), pages 106-110, January.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Aggregation Ranking Pareto;

    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:eee:matsoc:v:58:y:2009:i:1:p:58-63. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.