### On the complexity of testing membership in the core of min-cost spanning tree games

暂无分享，去创建一个

Sándor P. Fekete | Ulrich Faigle | Winfried Hochstättler | Walter Kern | U. Faigle | W. Kern | S. Fekete | W. Hochstättler

[1] Arie Tamir,et al. On the core of network synthesis games , 1991, Math. Program..

[2] Daniel Granot,et al. Minimum cost spanning tree games , 1981, Math. Program..

[3] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .

[4] Theo S. H. Driessen,et al. The irreducible Core of a minimum cost spanning tree game , 1993, ZOR Methods Model. Oper. Res..

[5] Xiaotie Deng,et al. On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[6] Daniel J. Kleitman,et al. Cost allocation for a spanning tree , 1973, Networks.

[7] C. G. Bird,et al. On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.

[8] Daniel Granot,et al. Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem , 1992, Math. Oper. Res..

[9] Daniel Granot,et al. The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games , 1982 .

[10] Nimrod Megiddo,et al. Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..

[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[13] Jeroen Kuipers. Combinatorial methods in cooperative game theory , 1994 .