On the vertices of the \(k\)-additive core (Q2519834)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the vertices of the \(k\)-additive core
scientific article

    Statements

    On the vertices of the \(k\)-additive core (English)
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    Let \((N, v)\) be a cooperative game with side-payments in coalition function form. It is well known [\textit{L. S. Shapley}, Int. J. Game Theory 1, 11--26 (1971; Zbl 0222.90054)] that when a \((N,v)\) is convex that it has a nonempty core, whose set of vertices is exactly the set of additive games induced by maximal chains. This paper considers the situation when the core is empty. It introduces the \(k\)-additive game, where \(k\) is the minimal integer that results in a non-empty core. It then shows conditions under which vertices of the \(k\)-core are induced by chains.
    0 references
    cooperative games
    0 references
    core
    0 references
    \(k\)-additive games
    0 references
    vertices
    0 references
    convex games
    0 references

    Identifiers