Weighted component fairness for forest games

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

Post-Print from HAL

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.

Keywords: (Weighted); component; fairness (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Published in Mathematical Social Sciences, 2012, 64 (2), pp.144-151. ⟨10.1016/j.mathsocsci.2012.03.004⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: 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:hal:journl:halshs-00678832

DOI: 10.1016/j.mathsocsci.2012.03.004

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().