Impossibilities for roommate problems

We establish three impossibility results for roommate problems. First, no single valued solution is Pareto optimal and anonymous. Next, no solution satisfies Pareto optimality, anonymity and converse consistency. Finally, no pseudo-refinement of the core satisfies consistency.Roommate problems Core extensions Consistency Converse Consistency

Compromise Rules Revisited

International audienceDecision makers often face a dilemma when they have to arbitrate between the quantity of support for a decision (i.e., the number of people who back it) and the quality of support (i.e., at which level to go down in voters’ preferences to obtain sufficient level of support). The trade-off between the quality and quantity of support behind alternatives led to numerous suggestions in social choice theory: without being exhaustive we can mention Majoritarian Compromise, Fallback Bargaining, Set of Efficient Compromises, Condorcet Practical Method, Median Voting Rule, Majority Judgement. Our point is that all these concepts share a common feature which enables us to gather them in the same class, the class of compromise rules, which are all based upon elementary scoring rules described extensively by Saari. One can exploit his results to analyze the compromise rules with relative ease, which is a major point of our paper

Coalitional stability and efficiency of partitions in matching problems

Matching, Membership property rights, Partition, Coalitional stability, Efficiency, C78,

The Manipulability of Matching Rules via Segmentation

Matching, Endowments, Segmentation, C78,