Games on graphs with coalitions
研究了策略为图节点且存在联盟结构的一次性和重复博弈，提出了与经典纳什和伯奇均衡可比的新型纯策略和混合策略均衡概念，并给出了重复图博弈的民间定理。
This paper models games where the strategies are nodes of a graph G (we denote them as G-games) and in presence of coalition structures. The cases of one-shot and repeated games are presented. In the latter situation, coalitions are assumed to move from a strategy to another one under the constraint that they are adjacent in the graph. We introduce novel concepts of pure and mixed equilibria which are comparable with classical Nash and Berge equilibria. A Folk Theorem for G-games of repeated type is presented.