On the computation of stability in multiple coalition formation games

In non-cooperative models of coalition formation, players have to decide whether or not to participate in a coalition (alliance). Game theoretic analyses of the formation of alliances in games with externalities, stress the difficulties in designing self-enforcing treaties because of free-riding. The presence of a strong free-rider incentive prevents most alliances of being stable and/or effective. This paper focuses on computing stability in a game on multiple coalition formation with membership rules and different transfer schemes. A new mathematical programming notation for game theory concepts is outlined. To compute stability, the new notation is used for implementation into computer coding. Implementation and computation aspects are discussed. Numerical illustration of the algorithm shows that stability varies with the applied membership rules and transfer schemes. An application of coalition formation to International Environmental Agreements (lEAs) is provided.