RT Journal Article
T1 An algorithm for finding the vertices of the k-additive monotone core
A1 Miranda Menéndez, Pedro
A1 Grabisch, Michel
AB Given a capacity, the set of dominating k-additive capacities is a convex polytope called the k-additive monotone core; 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 n-additive monotone core and we explore the possible translations for the k-additive case.
PB Elsevier
SN 0166-218X
YR 2012
FD 2012
LK https://hdl.handle.net/20.500.14352/42356
UL https://hdl.handle.net/20.500.14352/42356
LA eng
DS Docta Complutense
RD 8 abr 2025