Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/817
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLahiri, Somdeb-
dc.date.accessioned2010-01-18T08:45:14Z-
dc.date.available2010-01-18T08:45:14Z-
dc.date.copyright2001-02-
dc.date.issued2010-01-18T08:45:14Z-
dc.identifier.urihttp://hdl.handle.net/11718/817-
dc.description.abstractA Federation Boolean Vote Aggregator allows a finite set of coalitions to unilaterally elect any candidate from a set containing exactly two candidates. There are several special types of Federation Boolean Vote Aggregators, all of which share a property: the candidates are assigned weights, and for a coalition to be decisive, it is necessary that the sum of the weights of its members exceed a pre-assigned quota. In this paper we address the following question: When is a Federation Boolean Vote aggregator a Weighted Boolean Vote Aggregator?en
dc.language.isoenen
dc.relation.ispartofseriesWP;2001-02-02/1637-
dc.subjectAxiomatic - Characterizationen
dc.titleAxiomatic characterisation of weighted boolean vote aggregatorsen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 2001_1637.pdf792.18 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.