| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 972047 | Mathematical Social Sciences | 2012 | 8 Pages |
Abstract
⺠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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Sylvain Béal, Eric Rémila, Philippe Solal,