Abstract
We investigate the relations between, on the one hand, Galois connections and the related types of maps and, on the other hand, the axiomatic Arrowian approach for the aggregation (or consensus) problem in lattices. In the latter one wants to ”aggregate” n-tuples (n ≥ 2) of elements of a lattice L into an element of this lattice representing their ”consensus”, subject to satisfying some desirable properties. The main axiom is a generalization of Arrow’s [1] independence. The results consist in the characterization of convenient aggregation functions, and especially in impossibility ones when axioms turn to be incompatible. For the many applications of this theory in the domains of social choice or cluster analysis, see, e.g., the book of Day and McMorris [4]. Basic characterizations of Arrowian aggregation functions according to a specific typology of finite lattices are given by Monjardet [10]. They are extended to lattices of Galois maps (or polarized ones, that is maps appearing in Galois connections), then particularized to fuzzy preorders and hierarchical classifications, in Leclerc [7]. A unified presentation is given in Leclerc and Monjardet [8].
An FCA-related representation of Galois maps between two fixed lattices is given in Domenach and Leclerc [5] with the introduction of the so-called ”biclosed” relations. As pointed out in the unifying paper of Ganter [6], the notion of biclosed relations is related to several others in the literature. The first part of the presentation will be devoted to Arrowian aggregation of biclosed relations.
In the second part, we present another relation between Aggregation theory and residuated/residual maps (those appearing in Residuation Theory [2]), which corresponds to ”covariant” Galois connections. Chambers and Miller [3] and Leclerc and Monjardet [9] have recently pointed out that, in a significant class of atomistic lattices, an aggregation function is a meet-projection if and only if it is a residual mapping.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arrow, K.J.: Social Choice and Individual Values. Wiley, New York (1951)
Blyth, T.S., Janowitz, M.F.: Residuation theory. Pergamon Press, Oxford (1972)
Chambers, C.P., Miller, A.D.: Rules for Aggregating Information. Social Choice and Welfare 36, 75–82 (2011)
Day, W.H.E., McMorris, F.R.: Axiomatic Consensus Theory in Group Choice and Biomathematics. SIAM, Philadelphia (2003)
Domenach, F., Leclerc, B.: Biclosed binary relations and Galois connections. Order 18, 89–104 (2001)
Ganter, B.: Relational Galois connections. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 1–17. Springer, Heidelberg (2007)
Leclerc, B.: Aggregation of fuzzy preferences: a theoretic Arrow-like approach. Fuzzy Sets and Systems 43, 291–309 (1991)
Leclerc, B., Monjardet, B.: Latticial theory of consensus. In: Barnett, V., Moulin, H., Salles, M., Schofield, N. (eds.) Social Choice, Welfare and Ethics, pp. 145–159. Cambridge University Press, Cambridge (1995)
Leclerc, B., Monjardet, B.: Aggregation and residuation (2011) (submitted)
Monjardet, B.: Arrowian characterizations of latticial federation consensus functions. Mathematical Social Sciences 20, 51–71 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leclerc, B. (2011). Galois Connections in Axiomatic Aggregation. In: Valtchev, P., Jäschke, R. (eds) Formal Concept Analysis. ICFCA 2011. Lecture Notes in Computer Science(), vol 6628. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20514-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-20514-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20513-2
Online ISBN: 978-3-642-20514-9
eBook Packages: Computer ScienceComputer Science (R0)