SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On the complexity of testing membership in the core of min-cost spanning tree games
5 references·1 citing·21 second hop
On the complexity of testing membership in the core of min-cost spanning tree games (1997)On the complexity of testing membership i…On the Complexity of Cooperative Solution Concepts (1994)On the Complexity of Cooperat…On the core of network synthesis games (1991)On the core of network synthe…Minimum cost spanning tree games (1981)Minimum cost spanning tree ga…Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree (1978)Computational Complexity of t…On cost allocation for a spanning tree: A game theoretic approach (1976)On cost allocation for a span…Computing core allocations in cooperative games with an application to cooperative procurement (2010)Computing core allocations in…On the core and nucleolus of minimum cost spanning tree games (1984)A value for n -person games (1988)Applications of approximation algorithms to cooperative games (2001)Operations research games: A survey (2001)The Nucleolus of a Characteristic Function Game (1969)A Simple Expression for the Shapley Value in a Special Case (1973)Game Theory and Cost Allocation Problems (1986)Computational Aspects of Cooperative Game Theory (2012)Dynamic Version of the Economic Lot Size Model (1958)Dynamic Version of the Economic Lot Size Model (2004)Cores of convex games (1971)A linear approximation method for the Shapley value (2008)Polynomial calculation of the Shapley value based on sampling (2008)The assignment game I: The core (1971)On the core of linear production games (1975)Discrete location theory (1991)On some approximately balanced combinatorial cooperative games (1993)On the Complexity of Testing Membership in the Core of Min-Cost Spanning Tree Games (1997)Collaboration in transportation (2008)Algorithmic Aspects of the Core of Combinatorial Optimization Games (1999)Computational Aspects of Cooperative Game Theory (2011)
this work references cited by second hop

References

  • 1994On the Complexity of Cooperative Solution Concepts635 cited
  • 1976On cost allocation for a spanning tree: A game theoretic approach347 cited
  • 1981Minimum cost spanning tree games261 cited
  • 1978Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree191 cited
  • 1991On the core of network synthesis games85 cited

Cited by

  • 2010Computing core allocations in cooperative games with an application to cooperative procurement64 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work