Name
Abstract | ||
|---|---|---|
We study the set of allocation rules generated by component efficiency and weighted component fairness, a generalization of component fairness introduced by Herings et al. (2008). Firstly, if the underlying TU-game is superadditive, this set coincides with the core of a graph-restricted game associated with the forest game. Secondly, among this set, only the random tree solutions (Béal et al., 2010) induce Harsanyi payoff vectors for the associated graph-restricted game. We then obtain a new characterization of the random tree solutions in terms of component efficiency and weighted component fairness. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.mathsocsci.2012.03.004 | Mathematical Social Sciences |
Field | DocType | Volume |
Random tree,Superadditivity,Mathematical optimization,Mathematical economics,Mathematics,Stochastic game | Journal | 64 |
Issue | ISSN | Citations |
2 | 0165-4896 | 3 |
PageRank | References | Authors |
0.51 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sylvain Béal | 1 | 70 | 12.23 |
| Eric Rémila | 2 | 329 | 45.22 |
| Philippe Solal | 3 | 79 | 14.55 |