On the core of network synthesis games
暂无分享,去创建一个
[1] L. Shapley,et al. The assignment game I: The core , 1971 .
[2] Daniel Granot,et al. On cost allocation in communication networks , 1990, Networks.
[3] Daniel Granot,et al. On the core and nucleolus of minimum cost spanning tree games , 1984, Math. Program..
[4] T. C. Hu,et al. Synthesis of a Communication Network , 1964 .
[5] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[6] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[7] Nimrod Megiddo,et al. Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Daniel Granot,et al. Minimum cost spanning tree games , 1981, Math. Program..
[10] Martin Grötschel,et al. Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” , 1984, Comb..
[11] Guillermo Owen,et al. On the core of linear production games , 1975, Math. Program..
[12] T. C. Hu,et al. An Application of Generalized Linear Programming to Network Flows , 1962 .
[13] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[14] Daniel Granot,et al. A generalized linear production model: A unifying model , 1986, Math. Program..
[15] Eitan Zemel,et al. Generalized Network Problems Yielding Totally Balanced Games , 1982, Oper. Res..
[16] Daniel J. Kleitman,et al. Cost allocation for a spanning tree , 1973, Networks.
[17] Stef Tijs,et al. Traveling salesman games , 1992, Math. Program..
[18] Nimrod Megiddo,et al. Cost allocation for steiner trees , 1978, Networks.
[19] Eitan Zemel,et al. Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..
[20] D. R. Fulkerson,et al. Packing rooted directed cuts in a weighted directed graph , 1974, Math. Program..
[21] L. Shapley,et al. The kernel and bargaining set for convex games , 1971 .
[22] Martin Shubik,et al. The Assignment Game , 1971 .
[23] C. G. Bird,et al. On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.
[24] Arie Tamir,et al. On the core of a traveling salesman cost allocation game , 1989 .