22 research outputs found

    On Procedural Freedom of Choice

    Get PDF
    Numerous works in the last decade have analyzed the question of how to compare opportunity sets as a way to measure and evaluate individual freedom of choice.This paper defends that, in many contexts, external procedural aspects that are associated to an opportunity set should be taken into account when making judgements about the freedom of choice an agent enjoys.We propose criteria for comparing procedure-based opportunity sets that are consistent with both the procedural aspect of freedom and most of the standard theories of ranking opportunity sets.opportunity set;freedom of choice

    On Procedural Freedom of Choice

    Get PDF

    An axiomatic analysis of ranking sets under simple categorization

    Get PDF
    This paper contributes to the axiomatization of additive rules for ranking sets of objects under the psychological principle of categorization. Firstly we proceed with the case where the elements in the sets are categorized into at most three groups, namely good (with value 1), neutral (with value 0), and bad (with value-1). Secondly, we solve the case where there are only good and neutral elements. In both instances the evaluation of the sets is purely additive. Lastly, we show that dropping one of the axioms in our general characterization produces an axiomatization of the more general class of evaluations where good and bad elements are weighted differently. Areas of research in Economics such as committee selection problems, hedonic games and matching are among the ranking sets models where our results could potentially be applied

    On procedural freedom of choice

    No full text

    On procedural freedom of choice

    No full text

    Ranking Sets Additively in Decisional Contexts: An Axiomatic Characterization

    No full text
    Ranking finite subsets of a given set X of elements is the formal object of analysis in this paper. This problem has found a wide range of economic interpretations in the literature. The focus of the paper is on the family of rankings that are additively representable. Existing characterizations are too complex and hard to grasp in decisional contexts. Furthermore, Fishburn [13] 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 paper 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 [21] characterization of the cardinalitybased 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.
    corecore