Abstract
Ranking finite subsets of a given set X of elements is the formal object of analysis in this article. This problem has found a wide range of economic interpretations in the literature. The focus of the article is on the family of rankings that are additively representable. Existing characterizations are too complex and hard to grasp in decisional contexts. Furthermore, Fishburn (1996), Journal of Mathematical Psychology 40, 64–77 showed that the number of sufficient and necessary conditions that are needed to characterize such a family has no upper bound as the cardinality of X increases. In turn, this article proposes a way to overcome these difficulties and allows for the characterization of a meaningful (sub)family of additively representable rankings of sets by means of a few simple axioms. Pattanaik and Xu’s (1990), Recherches Economiques de Louvain 56, 383–390) characterization of the cardinality-based rule will be derived from our main result, and other new rules that stem from our general proposal are discussed and characterized in even simpler terms. In particular, we analyze restricted-cardinality based rules, where the set of “focal” elements is not given ex-ante; but brought out by the axioms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
