The average tree solution for cooperative games with communication structure (Q2268115): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3125550639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Position Value for Communication Situations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games / 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: 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
Property / cites work
 
Property / cites work: A characterization of the position value / rank
 
Normal rank
Property / cites work
 
Property / cites work: AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES / rank
 
Normal rank

Latest revision as of 13:37, 2 July 2024

scientific article
Language Label Description Also known as
English
The average tree solution for cooperative games with communication structure
scientific article

    Statements

    The average tree solution for cooperative games with communication structure (English)
    0 references
    0 references
    0 references
    0 references
    10 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    cooperative game
    0 references
    graph structure
    0 references
    single-valued solution
    0 references
    core
    0 references
    convexity
    0 references
    spanning tree
    0 references
    0 references