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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Limits of Tolerance
I propose a model of aggregation of intervals relevant to the study of legal standards of tolerance. Seven axioms: responsiveness, anonymity, continuity, strategyproofness, and three variants of neutrality are then used …
Anonymity and strategy-proofness on a domain of single-peaked and single-dipped preferences
We analyze the problem of locating a public facility on a line in a society where agents have either single-peaked or single-dipped preferences. We consider the domain analyzed in Alcalde-Unzu et al. (2024), where the ty…
Pareto-undominated strategy-proof rules in economies with multidimensional single-peaked preferences
In the problem of fully allocating a social endowment of perfectly divisible commodities among a group of agents with multidimensional single-peaked preferences, we study strategy-proof rules that are not Pareto-dominate…
The structure of strategy-proof rules
We establish that all strategy-proof social choice rules in strict preference domains follow necessarily a two-step procedure. In the first step, agents are asked to reveal some specific information about their preferenc…
Ranking Median Regression: Learning to Order through Local Consensus
This article is devoted to the problem of predicting the value taken by a random permutation $\Sigma$, describing the preferences of an individual over a set of numbered items $\{1,\; \ldots,\; n\}$ say, based on the obs…
regression