RT Book, Section
T1 On vertices of the k-additive monotone core
A1 Miranda Menéndez, Pedro
A1 Grabisch, Michel
A2 Carvalho, J.P.
A2 Dubois, D.
A2 Kaymak, U.
A2 Sousa, J.M.C.
AB 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
PB International Fuzzy Systems Association (IFSA); European Society for Fuzzy Logic and Technology (EUSFLAT)
SN 978-989-95079-6-8
YR 2009
FD 2009
LK https://hdl.handle.net/20.500.14352/53168
UL https://hdl.handle.net/20.500.14352/53168
LA eng
NO Proceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference, Lisbon, Portugal, July 20-24, 2009.
DS Docta Complutense
RD 15 dic 2025