Efficient and binary consensus functions on transitively valued relations
Given a set S, the consensus problem on S is that of the construction, for any integer v, of a mapping \(\Phi:S^ v\to S\) such that, for any v- tuple \(\eta =(s_ 1,...,s_ v)\in S^ v\), \(s=\Phi (\eta)\) is a good representative of \(\eta\). In order to have that, \(\Phi\) must satisfy some conditions, some of them based on structural properties of S and the others derived from considerations related to a domain of application. Since Arrow's theorem, preference aggregation is a classical consensus problem; many recent works concern consensus of classifications. This paper presents Arrow-like results on sets of transitively valued relations, or fuzzy quasi-orders, on a finite set X. Here, \[ S=\{q\in L^{X\times X}| (\forall x,y,z\in X)q(xz)\leq \max (q(xy),q(yz))\}, \] where \(0\in L\subseteq {\mathbb{R}}^+\). This set, with the pointwise order, has a lattice structure. The main result of the paper gives the general form of consensus functions \(\Phi\) satisfying two axioms adapted from Arrow's ones: \(\Phi =\bigvee^{v}_{i=1}\phi_ i\circ q_ i\), for some reductive and isotone mappings \(\phi_ 1,...,\phi_ v:\) \(L\to L.\) Various consequences of this result are derived by adding further conditions on \(\Phi\), by setting \(L=\{0,1\}\), or by considering restrictions of the domain or the codomain of \(\Phi\). In preference aggregation, results of Arrow (1951), Mas-Collel and Sonnenschein (1972), Brown (1975) and Mirkin (1981) are found again. In classification, one obtains a new result on the consensus of ultrametrics (or dendrograms, an important class of hierarchical classification models), with a result on partitions due to Mirkin (1975), as a special case.
- An Order Theoretic Model for Cluster Analysis
- Consensus functions defined on trees
- Consensus n-trees
- Description of some relations on the set of real-line intervals
- Faithful consensus methods for n-trees
- Federations and transitive group choice
- Fuzzy sets and systems. Theory and applications
- General Possibility Theorems for Group Decisions
- Homogeneous families of semiorders and the theory of probabilistic consistency
- scientific article; zbMATH DE number 3643317 (Why is no real title available?)
- scientific article; zbMATH DE number 3874429 (Why is no real title available?)
- scientific article; zbMATH DE number 3829582 (Why is no real title available?)
- scientific article; zbMATH DE number 3829583 (Why is no real title available?)
- scientific article; zbMATH DE number 3903773 (Why is no real title available?)
- scientific article; zbMATH DE number 3903777 (Why is no real title available?)
- scientific article; zbMATH DE number 3747198 (Why is no real title available?)
- scientific article; zbMATH DE number 3472043 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3635771 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3420808 (Why is no real title available?)
- Preference aggregation with randomized social orderings
- Social choice and individual values
- Structure of fuzzy binary relations
- Consensus rules based on decisive families: the case of hierarchies
- On the structure of fuzzy social welfare functions
- Axioms for consensus functions based on lower bounds in posets
- On the use of ordered sets in problems of comparison and consensus of classifications
- Comments on ``Aggregation of equivalence relations by P. C. Fishburn and A. Rubinstein
- Aggregation of fuzzy preferences: A theoretic Arrow-like approach
- Rationality and aggregation of preferences in an ordinally fuzzy framework
- Algorithms for strategyproof classification
- Consensus of partitions: a constructive approach
- Consensus functions on tree quasi-orders that satisfy an independence condition
- Lattices of choice functions and consensus problems
- Arrowian characterizations of latticial federation consensus functions
- The median procedure in the semilattice of orders
- Aggregation and residuation
- Manipulating an aggregation rule under ordinally fuzzy preferences
- On some oligarchy results when social preference is fuzzy
- Community standards
- Strategy-proof fuzzy aggregation rules
- Permutation invariance
- The plurality of social relations: \(k\)-partite representations of interdependent social forms
- Medians in LLD meet semilattices and the case of orders
- The consensus functional equation in agreement theory
- Non-manipulable partitioning
- Consensus of particular Moore families
- Consensus theories. An oriented survey
- On some connections between multidistances and valued m-ary adjacency relations
- scientific article; zbMATH DE number 4167784 (Why is no real title available?)
- Strategy-proof partitioning
- scientific article; zbMATH DE number 1082117 (Why is no real title available?)
- scientific article; zbMATH DE number 1484746 (Why is no real title available?)
- Separability and aggregation of equivalence relations
- The Median Procedure in a Formal Theory of Consensus
- scientific article; zbMATH DE number 894190 (Why is no real title available?)
- scientific article; zbMATH DE number 1405564 (Why is no real title available?)
- Graph aggregation
- Non-contradictory aggregation of quasi-order relations
- Some observations on oligarchies, internal direct sums, and lattice congruences
- Clustering and isolation in the consensus problem for partitions
- Arrow's theorem and max-star transitivity
- Rules for aggregating information
- Classification aggregation without unanimity
This page was built for publication: Efficient and binary consensus functions on transitively valued relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059534)