An algorithm for finding the vertices of the k-additive monotone core

作者：Miranda Pedro^*; Grabisch Michel

来源：Discrete Applied Mathematics, 2012, 160(4-5): 628-639.

DOI：10.1016/j.dam.2011.11.013

• Polyhedra
• Capacities
• k-additivity
• Dominance
• Core

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.

• 出版日期2012-3