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 present sucient conditions for the implementation of the (pessimistic) recursive core (Kóczy, 2007) in discrete partition function form games using a modified version of the sequential coalition formation game by Bloch (1996) extending the results of Kóczy (2008) and - in a slightly...

We study coalitional games where the proceeds from cooperation depend on the entire coalition structure. The coalition structure core (Kóczy, GEB, 2007) is a generalisation of the coalition structure core for such games. We introduce a noncooperative, sequential coalition formation model and...

We prove the existence of an upper bound for the number of blockings 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...