Weighted component fairness for forest games

Sylvain Béal, Eric Rémila and Philippe Solal

Mathematical Social Sciences, 2012, vol. 64, issue 2, 144-151

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.

Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489612000261
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Weighted component fairness for forest games (2012)
Working Paper: Weighted Component Fairness for Forest Games (2009)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:64:y:2012:i:2:p:144-151

DOI: 10.1016/j.mathsocsci.2012.03.004

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().