NP-completeness in hedonic games (Q1886742): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Core in a simple coalition formation game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing a best response automaton in repeated games with mixed strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability of hedonic coalition structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farsighted stability in hedonic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedonic Coalitions: Optimality and Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nucleolus of min-cost spanning tree games is NP-hard. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing membership in the core of min-cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing best-response automata in repeated games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minesweeper is NP-complete. / rank
 
Normal rank

Latest revision as of 15:27, 7 June 2024

scientific article
Language Label Description Also known as
English
NP-completeness in hedonic games
scientific article

    Statements

    NP-completeness in hedonic games (English)
    0 references
    0 references
    19 November 2004
    0 references
    0 references
    Hedonic games
    0 references
    Coalition formation
    0 references
    Computational complexity
    0 references
    NP-hard
    0 references
    NP-complete
    0 references
    0 references