Convex games with this property must have a non-empty core, meaning that they are totally balanced. If the characteristic function of games with this property is supermodular, (10[1])the function can exhibit “snowballing.” The MCST game is a game with this property in which each player in a complete graph has to seek out a supply node to create a minimum-cost spanning tree. The Nakamura number of games with this property is the minimal number of winning groups with empty intersection. Games with this property are simple if the pay-off is either zero or one. Vetoers in simple games with this property belong to all winning coalitions. Agents using a tit-for-tat (10[1])strategy (-5[3])first (-5[1])act (-5[1])in a method (10[1])described (-5[1])by (-5[2])this word (10[3]-5[1])before (10[1])reciprocating (10[3])their opponent’s move. For 10 points, name this word used to describe games that encourage working (-5[1])together. (10[1])■END■ (10[9]0[2])