Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
22 result(s) for "Savaglio, Ernesto"
Sort by:
On a diversity ranking of choice profiles
The di¤erent options people select from a set of non-rival alternatives are compared in terms of singularity. A criterion for ranking these choices on the basis of the number of other choices from which they di¤er is introduced and characterized. An axiomatic characterization of the ranking of choice pro…les based on the aggregation of the singularities of the chosen alternatives is also provided. JEL Classi…cation : D63 Keywords : Diversity, Freedom of choice, Orderings, Choice pro…les. \"The prosp ects of freedom in the contem p orary world m ay well lie in the recognition of the plurality of our identities, where p ersonal identity must b e understo o d as an extension of one's own choice of b eing som eone or doing som ething\" (A. K. Sen (2006))
Strategy-proof aggregation rules and single peakedness in bounded distributive lattices
It is shown that, under a very comprehensive notion of single peakedness, an aggregation rule on a bounded distributive lattice is strategy-proof on any rich domain of single peaked total preorders if and only if it admits one of three distinct and mutually equivalent representations by lattice-polynomials, namely whenever it can be represented as a generalized weak consensus rule, a generalized weak sponsorship rule, or an iterated median rule. The equivalence of individual and coalitional strategy-proofness that is known to hold for single peaked domains in bounded linearly ordered sets and in finite trees typically fails in such an extended setting. A related impossibility result concerning non-trivial anonymous and coalitionally strategy-proof aggregation rules is also obtained.
A Height-Based Multidimensional Extension of the Lorenz Preorder for Integer-Valued Distributions
We study multidimensional inequality on integers. In such a setting, a Lorenz-like preorder and a suitably adapted version of the Muirhead-Pigou-Dalton transfers are defined, and a counterpart of some classic results on inequality measurement is established in this multivariate setting.
Multidimensional Inequality with Variable Population Size
We study inequality in a context of more than one variable by extending a celebrated result of Hardy, Littlewood and Pölya (1934) to the case of distributions with variable population sizes, whose individuals differ in many characteristics besides income. A new ordering between rectangular matrices, representing such distributions, is provided and characterized by convexity theory.
Hyper-relations, choice functions, and orderings of opportunity sets
We prove a coincidence of the class of multi-preference hyper-relations and the class of decent hyper-relations (DHR), that is the class of binary relations on opportunity sets satisfying monotonicity, no-dummy, stability with respect to contraction and extension, and the union property. We study subclasses of DHR. In order to pursue our analysis, we establish a canonical bijection between DHR and the class of no-dummy heritage choice functions. From this we obtain that the no-dummy heritage choice functions have multi-criteria rationalizations with reflexive binary relations. We also prove that the restriction of this bijection to two subclasses of DHR, namely the transitive decent hyper-relations, and the ample hyper-relations, is a bijection between these subclasses and the classes of closed no-dummy choice functions and no-dummy path-independent choice functions (Plott functions), respectively.
Sufficientarian Grading Rules and Rankings: Characterizations and Implementation
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.
On the volume-ranking of opportunity sets in economic environments
We provide a characterization of the volume-ranking of opportunity sets as defined on the set of all polyconvex sets, i.e. finite unions of convex, compact, Euclidean sets. In fact, such a domain is large enough to encompass most of the opportunity sets typically encountered in economic environments, including non-linear or even non-convex budget sets, and opportunity sets arising from production sets. Our result relies on a valuation-based volume-characterization theorem due to Klain and Rota (Introduction to Geometric Probability, Cambridge University Press, Cambridge, 1997) and helps to highlight some quite unusual conditions under which the volumeranking can be justified as a freedom-ranking of opportunity sets. Therefore, it may also help to understand why the latter has been so conspicuously ignored in welfare analysis.
Strategy-proof aggregation rules in median semilattices with applications to preference aggregation
Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of generalized weak sponsorship rules induced by certain families of order filters of the coalition poset. It follows that the co-majority rule and many other inclusive aggregation rules belong to that class. The co-majority rule for an odd number of agents is characterized and shown to be equivalent to a Condorcet-Kemeny median rule. Applications to preference aggregation rules including Arrowian social welfare functions are also considered. The existence of strategy-proof anonymous, weakly neutral and unanimity-respecting social welfare functions which are defined on arbitrary profiles of total preorders and satisfy a suitably relaxed independence condition is shown to follow from our characterizations.
Strategy-proof aggregation rules in median semilattices with applications to preference aggregation
Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of generalized weak sponsorship rules induced by certain families of order filters of the coalition poset. It follows that the co-majority rule and many other inclusive aggregation rules belong to that class. The co-majority rule for an odd number of agents is characterized and shown to be equivalent to a Condorcet-Kemeny median rule. Applications to preference aggregation rules including Arrowian social welfare functions are also considered. The existence of strategy-proof anonymous, weakly neutral and unanimity-respecting social welfare functions which are defined on arbitrary profiles of total preorders and satisfy a suitably relaxed independence condition is shown to follow from our characterizations.
Strategy-Proof Aggregation Rules in Median Semilattices with Applications to Preference Aggregation
Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of generalized weak sponsorship rules induced by certain families of order filters of the coalition poset. It follows that the co-majority rule and many other inclusive aggregation rules belong to that class. The co-majority rule for an odd number of agents is characterized and shown to be equivalent to a Condorcet-Kemeny rule. Applications to preference aggregation rules including Arrowian social welfare functions are also considered. The existence of strategy-proof anonymous neutral and unanimity-respecting social welfare functions which are defined on arbitrary profiles of total preorders and satisfy a suitably relaxed independence condition is shown to follow from our characterizations.