IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/17455.html
   My bibliography  Save this paper

Weighted Component Fairness for Forest Games

Author

Listed:
  • Béal, Sylvain
  • Rémila, Eric
  • Solal, Philippe

Abstract

We present the axiom of weighted component fairness for the class of forest games, a generalization of component fairness introduced by Herings, Talman and van der Laan (2008) in order to characterize the average tree solution. Given a system of weights, component eciency and weighted component fairness yield a unique allocation rule. We provide an analysis of the set of allocation rules generated by component eciency and weighted component fairness. This allows us to provide a new characterization of the random tree solutions.

Suggested Citation

  • Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Weighted Component Fairness for Forest Games," MPRA Paper 17455, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:17455
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/17455/1/MPRA_paper_17455.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Talman, A.J.J. & Yamamoto, Y., 2007. "Games With Limited Communication Structure," Discussion Paper 2007-19, Tilburg University, Center for Economic Research.
    2. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    3. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    4. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    5. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2012. "Fair agreements for sharing international rivers with multiple springs and externalities," Journal of Environmental Economics and Management, Elsevier, vol. 63(3), pages 388-403.
    6. René Brink & Gerard Laan & Vitaly Pruzhansky, 2011. "Harsanyi power solutions for graph-restricted games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 87-110, February.
    7. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
    8. Tijs, Stef & Borm, Peter & Lohmann, Edwin & Quant, Marieke, 2011. "An average lexicographic value for cooperative games," European Journal of Operational Research, Elsevier, vol. 213(1), pages 210-220, August.
    9. Tijs, S.H., 2005. "The First Steps with Alexia, the Average Lexicographic Value," Discussion Paper 2005-123, Tilburg University, Center for Economic Research.
    10. Tijs, S.H., 2005. "The First Steps with Alexia, the Average Lexicographic Value," Other publications TiSEM 0b4f9565-59f7-477f-b8f8-9, Tilburg University, School of Economics and Management.
    11. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Rooted-tree solutions for tree games," European Journal of Operational Research, Elsevier, vol. 203(2), pages 404-408, June.
    12. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    13. Gabrielle Demange, 2004. "On Group Stability in Hierarchies and Networks," Journal of Political Economy, University of Chicago Press, vol. 112(4), pages 754-778, August.
    14. Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 23-38.
    15. E. Algaba & J. M. Bilbao & P. Borm & J. J. López, 2001. "The Myerson value for union stable structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(3), pages 359-371, December.
    16. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(2), pages 349-364, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2012. "Fair agreements for sharing international rivers with multiple springs and externalities," Journal of Environmental Economics and Management, Elsevier, vol. 63(3), pages 388-403.
    2. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Theory and Decision, Springer, vol. 79(2), pages 251-283, September.
    3. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2015. "Characterization of the Average Tree solution and its kernel," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 159-165.
    4. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    5. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2012. "The Sequential Equal Surplus Division for Sharing International Rivers with Bifurcations," Working Papers 2012-02, CRESE.
    6. Shan, Erfang & Zhang, Guang & Dong, Yanxia, 2016. "Component-wise proportional solutions for communication graph games," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 22-28.
    7. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "The sequential equal surplus division for sharing a river," MPRA Paper 37346, University Library of Munich, Germany.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    2. Sylvain Béal & Eric Rémila & Philippe Solal, 2012. "Compensations in the Shapley value and the compensation solutions for graph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 157-178, February.
    3. Sylvain Béal & Eric Rémila & Philippe Solal, 2022. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 818-849, May.
    4. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
    5. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Discussion Paper 2011-100, Tilburg University, Center for Economic Research.
    6. René Brink & P. Herings & Gerard Laan & A. Talman, 2015. "The Average Tree permission value for games with a permission tree," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 58(1), pages 99-123, January.
    7. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2015. "Characterization of the Average Tree solution and its kernel," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 159-165.
    8. Anna Khmelnitskaya & Gerard van der Laan & Dolf Talman, 2016. "Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games," Tinbergen Institute Discussion Papers 16-070/II, Tinbergen Institute.
    9. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    10. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "The sequential equal surplus division for sharing a river," MPRA Paper 37346, University Library of Munich, Germany.
    11. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    12. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Theory and Decision, Springer, vol. 79(2), pages 251-283, September.
    13. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    14. Baron, Richard & Béal, Sylvain & Remila, Eric & Solal, Philippe, 2008. "Average tree solutions for graph games," MPRA Paper 10189, University Library of Munich, Germany.
    15. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
    16. René Brink, 2017. "Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 1-33, April.
    17. Huseynov, T. & Talman, A.J.J., 2012. "The Communication Tree Value for TU-games with Graph Communication," Other publications TiSEM 6ba97d87-1ac6-4af7-a981-a, Tilburg University, School of Economics and Management.
    18. Wu, Hao & van den Brink, René & Estévez-Fernández, Arantza, 2024. "Highway toll allocation," Transportation Research Part B: Methodological, Elsevier, vol. 180(C).
    19. Napel, Stefan & Nohn, Andreas & Alonso-Meijide, José Maria, 2012. "Monotonicity of power in weighted voting games with restricted communication," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 247-257.
    20. Khmelnitskaya, Anna & Talman, Dolf, 2014. "Tree, web and average web values for cycle-free directed graph games," European Journal of Operational Research, Elsevier, vol. 235(1), pages 233-246.
    21. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, December.

    More about this item

    Keywords

    (Weighted) component fairness ; Core ; Graph games ; Alexia value ; Harsanyi solutions ; Random tree solutions.;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:17455. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.