Impacto
Downloads
Downloads per month over past year
Miranda Menéndez, Pedro and Grabisch, Michel (2012) An algorithm for finding the vertices of the k-additive monotone core. Discrete Applied Mathematics, 160 (4-5). pp. 628-639. ISSN 0166-218X
![]() |
PDF
Restringido a Repository staff only 303kB |
Official URL: http://www.sciencedirect.com/science/article/pii/S0166218X1100463X
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.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Polyhedra; Capacities; k-additivity; Dominance; Core |
Subjects: | Sciences > Statistics > Game theory |
ID Code: | 16860 |
Deposited On: | 25 Oct 2012 08:41 |
Last Modified: | 26 Jul 2018 07:37 |
Origin of downloads
Repository Staff Only: item control page