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

Abstract : 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.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00806905
Contributor : Michel Grabisch <>
Submitted on : Tuesday, April 2, 2013 - 3:33:12 PM
Last modification on : Wednesday, March 28, 2018 - 2:38:54 PM
Long-term archiving on : Wednesday, July 3, 2013 - 4:07:45 AM

File

dam11.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pedro Miranda, Michel Grabisch. An algorithm for finding the vertices of the k-additive monotone core. Discrete Applied Mathematics, Elsevier, 2012, 160 (4-5), pp.628-639. ⟨10.1016/j.dam.2011.11.013⟩. ⟨hal-00806905⟩

Share

Metrics

Record views

264

Files downloads

133