A characterization of the average tree solution for tree games (Q532714): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Position Value for Communication Situations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intermediate preferences and stable coalition structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average tree solution for cycle-free graph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of partitioning games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly balanced cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Cooperation in Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conference structures and fair allocation rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank

Latest revision as of 01:12, 4 July 2024

scientific article
Language Label Description Also known as
English
A characterization of the average tree solution for tree games
scientific article

    Statements

    A characterization of the average tree solution for tree games (English)
    0 references
    0 references
    0 references
    5 May 2011
    0 references
    0 references
    tree
    0 references
    graph games
    0 references
    Myerson value
    0 references
    Shapley value
    0 references
    0 references