Weighted component fairness for forest games

► Weighted component fairness generalizes component fairness (Herings et al., 2008). ► Component efficiency and weighted component fairness generate allocation rules. ► This set of rules coincides with the core of a graph-restricted superadditive game. ► Only the random tree solutions (Béal et al., 2010) induced Harsanyi payoff vectors. ► We obtain a new characterization of the random tree solutions.