Paper Info
Title
Aggregation on a Cartesian Product of Bounded Partially Ordered Sets
Abstract
Aggregation functions on bounded partially ordered sets have been extensively studied for more than thirty years. In this paper, we study aggregation functions on a specific type of bounded partially ordered set: a Cartesian product of several bounded partially ordered sets. In particular, we position this type of aggregation into the recently-introduced framework of aggregation on sets equipped with a betweenness relation (besets), which are a natural generalization of partially ordered sets. The main result is that, depending on the considered set of bounds for the beset associated with the Cartesian product of several bounded partially ordered sets, we obtain two alternative notions: classical aggregation functions w.r.t. the product order on the entire Cartesian product of the bounded partially ordered sets or componentwise aggregation functions acting separately on each of the bounded partially ordered sets.
Year
DOI
Venue
2022
10.1007/978-3-031-08971-8_1
Information Processing and Management of Uncertainty in Knowledge-Based Systems
Keywords
DocType
ISSN
Aggregation, Cartesian product, Poset, Beset
Conference
1865-0929
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Pérez-Fernández Raúl100.34
Bernard De Baets22994300.39