Efficient and binary consensus functions on transitively valued relations

DOI10.1016/0165-4896(84)90060-XzbMath0566.90003OpenAlexW2018450264MaRDI QIDQ1059534

Bruno Leclerc

Publication date: 1984

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(84)90060-x

zbMATH Keywords

preference aggregationhierarchical classificationfuzzy quasi-ordersconsensus problem

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Theory of fuzzy sets, etc. (03E72) Individual preferences (91B08) Social choice (91B14)

Related Items (25)

The median procedure in the semilattice of orders ⋮ On the structure of fuzzy social welfare functions ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strategy-proof partitioning ⋮ On some oligarchy results when social preference is fuzzy ⋮ Arrow's theorem and max-star transitivity ⋮ Rules for aggregating information ⋮ Aggregation and residuation ⋮ Community standards ⋮ Separability and aggregation of equivalence relations ⋮ Strategy-proof fuzzy aggregation rules ⋮ Aggregation of fuzzy preferences: A theoretic Arrow-like approach ⋮ Graph aggregation ⋮ 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 ⋮ Manipulating an aggregation rule under ordinally fuzzy preferences ⋮ Clustering and isolation in the consensus problem for partitions ⋮ Arrowian characterizations of latticial federation consensus functions ⋮ NON-MANIPULABLE PARTITIONING ⋮ Some Observations on Oligarchies, Internal Direct Sums, and Lattice Congruences

Cites Work

• Faithful consensus methods for n-trees
• Fuzzy sets and systems. Theory and applications
• Consensus n-trees
• Structure of fuzzy binary relations
• Federations and transitive group choice
• Preference aggregation with randomized social orderings
• Consensus functions defined on trees
• Homogeneous families of semiorders and the theory of probabilistic consistency
• Description of some relations on the set of real-line intervals
• An Order Theoretic Model for Cluster Analysis
• General Possibility Theorems for Group Decisions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient and binary consensus functions on transitively valued relations