This paper compares two game-theoretic methods, Shapley and Banzhaf values, or explaining tree ensemble model predictions. It introduces a faster algorithm for computing Banzhaf values, which run more efficiently than the current Shapley-based methods. Both methods provide similar feature importance scores, but the Banzhaf value is not only quicker to compute but also more numerically stable, making it a strong alternative for model explanation.