2006年，Alonso-Meijide和Fiestras-Janeiro考虑了以图作为合作结构的可转移效用对策模型（简称为图对策），提出了图对策Banzhaf值，它是经典Banzhaf值的一类推广。本文进一步将Banzhaf值推广到超图对策中，定义了超图对策Banzhaf值。其次，证明了超图对策Banzhaf值满足分支可分解性、分支总贡献性、公平性、平衡贡献性以及隔离性，并给出了该值的两种公理性刻画。最后，举例分析了超图对策Banzhaf值所满足的性质。

Alonso-Meijide and Fiestras-Janeiro(2006) introduced TU games with restricted cooperative structure represented by an undirected graph, or simple graph games, and present the Banzhaf value of the graph game, that extend the Banzhaf value. In this paper, we first generalize the Banzhaf value to the hypergraph game, define the Banzhaf value of the hypergraph game. Secondly, we prove that the Banzhaf value of the hypergraph game satisfies the property of component decomposability, component total contribution, fairness, balanced contribution, and isolation, and propose two characterizations of this value. Finally, we give an example to illustrate the properties satisfied by the Banzhaf value of the hypergraph game.