On the vertices of the k-additive core



Downloads per month over past year

Grabisch, Michel and Miranda Menéndez, Pedro (2008) On the vertices of the k-additive core. Discrete Mathematics, 308 (22). pp. 5204-5217. ISSN 0012-365X

[thumbnail of Miranda08.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.sciencedirect.com/science/journal/0012365X


The core of a game upsilon on N, which is the set of additive games phi dominating upsilon such that phi(N) = upsilon(N), is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular functions, matroids and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define the k-additive core by replacing additive games by k-additive games in the definition of the core, where k-additive games are those games whose Mobius transform vanishes for subsets of more than k elements. For a sufficiently high value of k, the k-additive core is nonempty, and is a convex closed polyhedron. Our aim is to establish results similar to the classical results of Shapley and Ichiishi on the core of convex games (corresponds to Edmonds' theorem for the greedy algorithm). which characterize the vertices of the core.

Item Type:Article
Uncontrolled Keywords:Cooperative games; Core; k-additive games; Vertices
Subjects:Sciences > Statistics > Game theory
ID Code:17032
Deposited On:06 Nov 2012 12:20
Last Modified:21 Jun 2018 10:47

Origin of downloads

Repository Staff Only: item control page