Miranda Menéndez, PedroGrabisch, Michel2023-06-202023-06-2020120166-218X10.1016/j.dam.2011.11.013https://hdl.handle.net/20.500.14352/42356Given 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.engjournal articlehttp://www.sciencedirect.com/science/article/pii/S0166218X1100463Xhttp://www.sciencedirect.comrestricted access519.83PolyhedraCapacitiesk-additivityDominanceCoreTeoría de Juegos1207.06 Teoría de Juegos