Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s13160-012-0078-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035507135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing 2-terminal reliability for radio-broadcast networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: REDUCTION OF ULTRAMETRIC MINIMUM COST SPANNING TREE GAMES TO COST ALLOCATION GAMES ON ROOTED TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power Indices in Spanning Connectivity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinants of matrices related to the Pascal triangle / 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 a minimal cost spanning tree: beyond the folk solution / 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 complexity of testing membership in the core of min-cost spanning tree games / 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: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost spanning tree games / 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: On the core and nucleolus of minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the distance between subtrees of a tree by the associated tight span / 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: On the shortest spanning subtree of a graph and the traveling salesman problem / 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: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank

Latest revision as of 01:22, 6 July 2024

scientific article
Language Label Description Also known as
English
Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
scientific article

    Statements

    Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (English)
    0 references
    0 references
    28 December 2012
    0 references
    0 references
    Shapley value
    0 references
    cooperative game
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references