Stable Partitions in Many Division Problems
We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists of...
| Authors: | , , , |
|---|---|
| Format: | article |
| Publication Date: | 2015 |
| Country: | España |
| Institution: | Universitat Autònoma de Barcelona |
| Repository: | Dipòsit Digital de Documents de la UAB |
| Language: | English |
| OAI Identifier: | oai:ddd.uab.cat:182478 |
| Online Access: | https://ddd.uab.cat/record/182478 https://dx.doi.org/urn:doi:10.1007/s11238-014-9467-7 |
| Access Level: | Open access |
| Keyword: | Division problem Symmetric single-peaked preferences Stable partition |
| Summary: | We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists of a partition function and a solution. Given a preference profile, a partition is selected and as many units of the good as the number of coalitions in the partition are allocated, where each unit is shared among all agents belonging to the same coalition according to the solution. A rule is stable at a preference profile if no agent strictly prefers to leave his coalition to join another coalition and all members of the receiving coalition want to admit him. We show that the proportional solution and all sequential dictator solutions admit stable partition functions. We also show that stability is a strong requirement that becomes easily incompatible with other desirable properties like efficiency, strategy-proofness, anonymity, and non-envyness. |
|---|