The sequential coalition formation model of Bloch (1996) to solve cooperative games with externalities exhibits some anomalies when related to classical concepts. We elaborate on these problems, define a modification of Bloch's model and show that its order-independent equilibria coincide with...

We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can...

We study coalitional games where the coalitional payoffs depend on the entire coalition structure. We introduce a noncooperative, sequential coalition formation model and show that the set of equilibrium outcomes coincides with the recursive core, a generalisation of the core to such games. In...