We extend the well-known model of graph-restricted games due to Myerson to signed graphs. In our model, it is possible to explicitly define not only that some players are friends (as in Myerson's model) but also that some other players are enemies. As such our games can express a wider range of situations, e.g., animosities between political parties. We define the value for signed graph games using the axiomatic approach that closely follows the celebrated characterization of the Myerson value. Furthermore, we propose an algorithm for computing an arbitrary semivalue, including the extension of the Myerson value proposed by us. We also develop a pseudo-polynomial algorithm for power indices in weighted voting games for signed graphs with bounded treewidth. Moreover, we consider signed graph games with a priori defined alliances (unions) between players and propose algorithms to compute the extension of the Owen value to this setting.

我们将由于 Myerson 的著名的图限制游戏模型扩展到签名图。在我们的模型中，不仅可以明确定义某些玩家是朋友（如在 Myerson 模型中），还可以明确定义其他一些玩家是敌人。因此，我们的游戏可以表达更广泛的情况，例如政党之间的敌意。我们使用公理化方法定义签名图形游戏的值，该方法紧密遵循著名的迈尔森值表征。此外，我们提出了一种计算任意半值的算法，包括我们提出的迈尔森值的扩展。我们还为有界树宽的有符号图的加权投票游戏中的功率指数开发了一种伪多项式算法。而且，