Removal independent consensus methods for closed [beta]-systems of sets

Gary D. Crown, Melvin F. Janowitz and Robert C. Powers

Mathematical Social Sciences, 2009, vol. 57, issue 3, 325-332

Abstract: Let [beta] be a positive integer and let E be a finite nonempty set. A closed [beta]-system of sets on E is a collection H of subsets of E such that A[set membership, variant]H implies A>=[beta], E[set membership, variant]H, and A[intersection]B[set membership, variant]H whenever A,B[set membership, variant]H with A[intersection]B>=[beta]. If is a class of closed [beta]-systems of sets and n is a positive integer, then is a consensus method. In this paper we study consensus methods that satisfy a structure preserving condition called removal independence. The basic idea behind removal independence is that if two input profiles P,P* in agree when restricted to a subset A of E, then their consensus outputs C(P),C(P*) agree when restricted to A. By working with the axiom of removal independence and classes of closed [beta]-systems of sets we obtain a result for consensus methods that is in the same spirit as Arrow's Impossibility Theorem for social welfare functions.

Keywords: Consensus; methods; Removal; independence; Closed; [beta]-systems; of; sets (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165-4896(08)00127-3
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:57:y:2009:i:3:p:325-332

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().