Minimum cost spanning tree games (Q3911709)

From MaRDI portal
Revision as of 12:21, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum cost spanning tree games
scientific article

    Statements

    title
    Minimum cost spanning tree games (English)
    0 references
    DOI
    10.1007/BF01584227
    0 references
    author
    Daniel Granot
    0 references
    Gur Huberman
    0 references
    publication date
    1981
    0 references
    Mathematics Subject Classification ID
    91A40
    0 references
    91A12
    0 references
    91B32
    0 references
    91A80
    0 references
    zbMATH DE Number
    3722469
    0 references
    zbMATH Keywords
    minimum cost spanning tree games
    0 references
    cooperative game
    0 references
    characteristic function form
    0 references
    efficient coalition structures
    0 references
    nucleolus
    0 references
    cost allocation
    0 references
    nonemptiness theorem
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3911709&oldid=34651998"
    Powered by MediaWiki