Sharing a minimal cost spanning tree: beyond the folk solution (Q980947): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fair rule in minimum cost spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimistic \(TU\) game in minimum cost spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cost allocation for a spanning tree: A game theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the Cost of a Capacity Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(P\)-value for cost sharing in minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost allocation for a spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost monotonicity, consistency and minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core and nucleolus of minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatization of the Shapley value on minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost spanning tree games and population monotonic allocation schemes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obligation rules for minimum cost spanning tree situations and their monotonicity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395224 / rank
 
Normal rank

Latest revision as of 00:44, 3 July 2024

scientific article
Language Label Description Also known as
English
Sharing a minimal cost spanning tree: beyond the folk solution
scientific article

    Statements

    Sharing a minimal cost spanning tree: beyond the folk solution (English)
    0 references
    0 references
    0 references
    8 July 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references