Miranda Menéndez, PedroCombarro, Elías F.2023-06-202023-06-2020100165-011410.1016/j.fss.2010.03.016https://hdl.handle.net/20.500.14352/42364In this paper we present some results concerning the vertices of the set of fuzzy measures being at most k-additive. We provide an algorithm to compute them. We give some examples of the results obtained with this algorithm and give lower bounds on the number of vertices for the (n - 1)-additive case, proving that it grows much faster than the number of vertices of the general fuzzy measures. The results in the paper suggest that the structure of k-additive measures might be more complex than expected from their definition and, in particular, that they are more complex than general fuzzy measures.engOn the structure of the k-additive fuzzy measuresjournal articlehttp://www.sciencedirect.com/science/article/pii/S0165011410001351http://www.sciencedirect.comrestricted access515.1Fuzzy measuresk-Additive measuresVerticesTopología1210 Topología