Sufficientarian Grading Rules and Rankings: Characterizations and Implementation

Marcello Basili, Ernesto Savaglio and Stefano Vannucci

Papers from arXiv.org

Abstract: Sufficientarian grading rules are defined using a finite family of sufficientarian judgements on individual capability assignments as embodied in a sufficientarian binary grading function (BGF). Both sufficientarian grading rules and the sufficientarian total preorders on capability-type assignments they induce are characterized. Moreover, several further total preorders based upon sufficiency-gap information provided by a sufficientarian grading rule are explicitly defined and some of them are also characterized. It is also shown that there exists a class of inclusive, unanimity-respecting and suitably strategy-proof protocols (including simple majority when the number of agents is odd) which can be deployed in order to select one specific sufficientarian grading rule.

Date: 2026-07
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/pdf/2607.08293 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2607.08293

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().