ABSTRACT
The solution concepts examined in the previous five chapters have been addressed to the general case of n-person games in characteristic function form with sidepayments. In this and the following chapter, theories limited in scope to simple games, a major class of characteristic function games, are considered. Recall from section (2.5) that simple games are characterized by every coalition having either a “winning” value of 1 or a “losing” value of 0. They also have the “monotonic” property (Peleg, 1980) that if a coalition S is winning, then all coalitions of which S is a subset are also winning.
