This paper by Yang (2010) belongs to a recent wave of literature that study the core of a cooperative game as a dynamic concept. Sengupta and Sengupta (1996) have shown that from any imputation the core can be accessed by a finite number of blocks. Kóczy (2006) provided an alternative blocking sequence and showed that the number of blocks required is bounded. The present paper relies on the proof of Sengupta and Sengupta by using
z-dominance and provides an explicit bound on the length of
z-dominance paths: the number of active coalitions, that is, coalitions with a payoff higher than the sum of their members' individual payoffs.
