Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1901
Full metadata record
DC FieldValueLanguage
dc.creatorBarberà, Salvador-
dc.creatorMassó, Jordi-
dc.creatorNeme, Alejandro-
dc.date2007-11-06T10:27:50Z-
dc.date2007-11-06T10:27:50Z-
dc.date2001-10-23-
dc.date.accessioned2017-01-31T00:58:09Z-
dc.date.available2017-01-31T00:58:09Z-
dc.identifierhttp://hdl.handle.net/10261/1901-
dc.identifier.urihttp://dspace.mediu.edu.my:8181/xmlui/handle/10261/1901-
dc.descriptionWe consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters' preferences are separable or additively representable.-
dc.languageeng-
dc.relationUFAE and IAE Working Papers-
dc.relation501.01-
dc.rightsopenAccess-
dc.subjectVoting-
dc.subjectStrategy-proofness-
dc.subjectAdditive and Separable Preferences-
dc.titleVoting by Committees under Constraints-
dc.typeDocumento de trabajo-
Appears in Collections:Digital Csic

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.