On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of nucleolus computation for bipartite \(b\)-matching games
scientific article

    Statements

    On the complexity of nucleolus computation for bipartite \(b\)-matching games (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2022
    0 references
    nucleolus
    0 references
    \(b\)-matching
    0 references
    cooperative game theory
    0 references
    computational complexity
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references