Coalition games over Kripke semantics
Résumé
We show that Pauly’s Coalition Logic can be embedded into a richer normal modal logic that we call Normal Simulation of Coalition Logic (NCL). We establish that the latter is strictly more expressive than the former by proving that it is NEXPTIME complete in the case of at least two agents.