Efficient and Stable Collective Choices under Crowding Preferences
We consider a set of agents who have to choose one alternative among a finite set of social alternatives. A final allocation is a pair given by the selected alternative and the group of its users. Agents have crowding preferences over allocations: between any pair of allocations with the same alternative, they prefer the allocation with the largest number of users. We require that a decision be efficient and stable (which guarantees free participation in the group of users and free exit from it). We propose a two-stage sequential mechanism whose unique subgame perfect equilibrium outcome is an efficient and stable allocation which also satisfies a maximal participation property. The social choice function implemented by the proposed mechanism is also anonymous and group stable.
|Date of creation:||01 Nov 2004|
|Date of revision:|
|Contact details of provider:|| Postal: 08193, Bellaterra, Barcelona|
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Web page: http://pareto.uab.cat
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- D. Berga & G. Bergantiños & J. Massó & A. Neme, 2006.
"On Exiting After Voting,"
International Journal of Game Theory,
Springer;Game Theory Society, vol. 34(1), pages 33-54, April.
- Berga, Dolors & Bergantiños, Gustavo & Massó, Jordi & Neme, Alejandro, 2003. "On Exiting after Voting," Working Papers of the Department of Economics, University of Girona 6, Department of Economics, University of Girona.
- M. Sanver, 2006. "Nash implementing non-monotonic social choice rules by awards," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 28(2), pages 453-460, 06.
When requesting a correction, please mention this item's handle: RePEc:aub:autbar:638.04. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Xavier Vila)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.