Cooperation and Defection in a Generalized Modal Setting.
Tara Nicholson · 2002
Abstract A modal logical schema is introduced for the exploration of a multi-player generalization of the Prisoner’s Dilemma in which (a) each participant has at least k available moves, and (b) participants can be members of more than one coalition of successful participants. The methodology employed illustrates how the principle governing the aggregative behaviour of formulae within the scope of the ✷ operator in the models for a class of non-standard modal logics can be manipulated to represent listcolouring properties for hypergraphs.