%0 Book Section
%T On vertices of the k-additive monotone core
publisher International Fuzzy Systems Association (IFSA); European Society for Fuzzy Logic and Technology (EUSFLAT)
%D 2009
%U 978-989-95079-6-8
%@ https://hdl.handle.net/20.500.14352/53168
%X Given a capacity, the set of dominating k-additive capacities is a convex polytope; thus, it is defined by its vertices. In this paper we deal with the problem of deriving a procedure to obtain such vertices in the line of the results of Shapley and Ichiishi for the additive case. We propose an algorithm to determine the vertices of the k-additive monotone core. Then, we characterize the vertices of the n-additive core and finally, we explore the possible translations for the k-additive case
%~