期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

树上最大支撑森林对策 被引量：1

The Max-Cost Spanning Forest Games on Tree
下载PDF
导出
摘要 本文在无向网络上定义了最大支撑森林对策,利用图论知识研究了树上最大支撑森林对策的核和核仁,并将所得结论推广到无关网络上. The max-cost spanning forest game on undirected network is defined in this paper,the kernel and the nucleolus of the max-cost spanning forest game on tree are studied by the knowledge of Graph Theory,and conclusions obtained are extended to the inessential network.
作者 谢政 李文屏 杨晓凌
机构地区 国防科学技术大学理学院
出处 《应用数学与计算数学学报》 2010年第2期42-48,共7页 Communication on Applied Mathematics and Computation
关键词 最大支撑森林对策 核 核仁 树 max-cost spanning forest games kernel nucleolus tree
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献6

  • 1Bird C.G . On cost allocation for a spanning tree: A game theory approach[J] . Networks, 1976,6: 835-350.
  • 2Granot D., Huberman G . On minimum cost spanning tree games[J] . Mathematical Programming, 1981, 21: 1-18.
  • 3Granot D., Maschler M., Owen G., Zhu W.R . The Kernel/Nucleolus of a Standard Tree Game[J] . Int J Game Theory, 1996, 9.5: 219-244.
  • 4Granot D., Maschler M. Spanning network games[J] . Int J Game Theory, 1998, 27: 467-500.
  • 5Faigle U., Kern W., Kuipers J . Computation the nucleolus of min-cost spanning tree games is NP-hard[J] . Int J Game Theory, 1998, 27: 443-450.
  • 6Maschler NL, Peleg B., Shapley L.S . The kernel and the bargaining set for convex games[J1. Int J Game Theory, 1972, 1: 73-93.

同被引文献17

  • 1Claus, A. and Kleitman, D.J., Cost allocation for a spanning tree,Networks, 1973, 3(4): 289-304.
  • 2Bird, C.G., On cost allocation for a spanning tree,Networks, 1976, 6(4): 335-350.
  • 3Claus, A. and Granot, D., Game theory application to cost allocation for a spanning tree,Working paper, Faculty of Commerce and Business Administration, University of British Columbia, 1976.
  • 4Megiddo, N., Computational complexity of the game theory approach to cost allocation for a tree,Math. of Oper. Res., 1978, 3(3): 189-196.
  • 5Megiddo, N., Cost allocation for Steiner trees,Networks, 1978, 8(1): 1-6.
  • 6Granot, D. and Huberman, G., Minimum cost spanning tree games,Mathematical Programming, 1981, 21(1): 1-18.
  • 7Granot, D. and Huberman, G., On the core and nucleolus of minimum cost spanning tree games,Mathematical Programming, 1984, 29(3): 323-347.
  • 8Granot, D. and Maschler, M., On some spanning network games,Working paper, Faculty of Commerce and Business Administration, University of British Columbia, 1991.
  • 9Granot, D. and Maschler, M., Spanning network games,International Journal of Game Theory, 1998, 27(4): 467-500.
  • 10Granot, D., Granot, F. and Zhu, W.R., Characterization sets for the nucleolus,International Journal of Game Theory, 1998, 27(3): 359-374.

引证文献1

应用数学与计算数学学报
2010年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部