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

Pedro Miranda () and Michel Grabisch
Additional contact information
Pedro Miranda: UCM - Universidad Complutense de Madrid = Complutense University of Madrid [Madrid]

Post-Print from HAL

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.

Keywords: polyhedra; Capacities; k-additivity; Dominance; Core (search for similar items in EconPapers)
Date: 2012
Note: View the original document on HAL open archive server: https://hal.science/hal-00806905v1
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Discrete Applied Mathematics, 2012, 160 (4-5), pp.628-639. ⟨10.1016/j.dam.2011.11.013⟩

Downloads: (external link)
https://hal.science/hal-00806905v1/document (application/pdf)

Related works:
Working Paper: An algorithm for finding the vertices of the k-additive monotone core (2012)
Working Paper: An algorithm for finding the vertices of the k-additive monotone core (2012)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00806905

DOI: 10.1016/j.dam.2011.11.013

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().