NP-completeness in hedonic games (Q1886742)

From MaRDI portal
Revision as of 12:07, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
NP-completeness in hedonic games
scientific article

    Statements

    title
    NP-completeness in hedonic games (English)
    0 references
    author
    Coralio Ballester
    0 references
    publication date
    19 November 2004
    0 references
    zbMATH Keywords
    Hedonic games
    0 references
    Coalition formation
    0 references
    Computational complexity
    0 references
    NP-hard
    0 references
    NP-complete
    0 references

    Identifiers

    zbMATH DE Number
    2116807
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1886742&oldid=14289171"
    Powered by MediaWiki