Aggregation of equivalence relations
type: Item
instance of: scholarly article
title: Aggregation of equivalence relations
zbMATH Open document ID: 0607.62141
DOI: 10.1007/BF01896812
author: Peter Fishburn
author: Ariel Rubinstein
published in: Journal of Classification
publication date: 1986-01-01T00:00:00Z
review text: Each of n attributes partitions a set of items into equivalence classes. A consistent aggregator of the n partitions is defined as an aggregate partition that satisfies an independence condition and a unanimity condition. It is shown that the class of consistent aggregators is precisely the class of conjunctive aggregators. That is, for each consistent aggregator there is a nonempty subset N of the attributes such that two items are equivalent in the aggregate partition if and only if they are equivalent with respect to each attribute in N.
Mathematics Subject Classification ID: 62P99
Mathematics Subject Classification ID: 91B14
zbMATH DE Number: 3982383
zbMATH Keywords: equivalence relations
zbMATH Keywords: consistent aggregator
zbMATH Keywords: independence condition
zbMATH Keywords: unanimity condition
zbMATH Keywords: conjunctive aggregators
MaRDI profile type: Publication
cites work: Social choice and individual values
cites work: Q5668657
cites work: Algebraic aggregation theory
cites work: On the theory of aggregation
full work available at URL: https://doi.org/10.1007/bf01896812
OpenAlex ID: W2082382647
Recommended article: Separability and aggregation of equivalence relations
Recommended article: Q3752445
Recommended article: Q3777503
Recommended article: Aggregation of T-transitive relations
Recommended article: Finite unions of equivalence relations
Recommended article: AGGREGATION AND IDEMPOTENCE
Recommended article: Structurable equivalence relations
Recommended article: Simple and large equivalence relations
description: scientific article; zbMATH DE number 3982383