IDEAS home Printed from https://ideas.repec.org/p/crb/wpaper/2014-04.html
   My bibliography  Save this paper

Characterization of the Average Tree solution and its kernel

Author

Listed:
  • Sylvain Béal

    (CRESE, Université de Franche-Comté)

  • Eric Rémila

    (Université de Saint-Etienne, CNRS UMR 5824 GATE Lyon Saint-Etienne)

  • Philippe Solal

    (Université de Saint-Etienne, CNRS UMR 5824 GATE Lyon Saint-Etienne)

Abstract

In this article, we study cooperative games with limited cooperation possibilities, represented by a tree on the set of agents. Agents in the game can cooperate if they are connected in the tree. We first derive direct-sum decompositions of the space of TU-games on a fixed tree, and two new basis for these spaces of TU-games. We then focus our attention on the Average (rooted)-Tree solution (see Herings, P., van der Laan, G., Talman, D., 2008. The Average Tree Solution for Cycle-free Games. Games and Economic Behavior 62, 77-92). We provide a basis for its kernel and a new axiomatic characterization by using the classical axiom for inessential games, and two new axioms of invariance, namely Invariance with respect to irrelevant coalitions and Weighted addition invariance on bi-partitions.

Suggested Citation

  • Sylvain Béal & Eric Rémila & Philippe Solal, 2014. "Characterization of the Average Tree solution and its kernel," Working Papers 2014-04, CRESE.
    • Handle: RePEc:crb:wpaper:2014-04
    as

    Download full text from publisher

    File URL: https://crese.univ-fcomte.fr/uploads/wp/WP-2014-04.pdf
    File Function: First version, 2014
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Axioms of invariance for TU-games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 891-902, November.
    2. 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.
    3. Koji Yokote, 2015. "Weak addition invariance and axiomatization of the weighted Shapley value," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 275-293, May.
    4. 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.
    5. Evans, Robert A., 1996. "Value, Consistency, and Random Coalition Formation," Games and Economic Behavior, Elsevier, vol. 12(1), pages 68-80, January.
    6. S. Béal & A. Lardon & E. Rémila & P. Solal, 2012. "The average tree solution for multi-choice forest games," Annals of Operations Research, Springer, vol. 196(1), pages 27-51, July.
    7. 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.
    8. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.
    9. 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.
    10. Sylvain Béal & Eric Rémila & Philippe Solal, 2013. "A Decomposition of the Space of TU-games Using Addition and Transfer Invariance," Working Papers 2013-08, CRESE.
    11. Sylvain Béal & Eric Rémila & Philippe Solal, 2014. "Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value," Working Papers hal-01377929, HAL.
    12. Debasis Mishra & A. Talman, 2010. "A characterization of the average tree solution for tree games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 105-111, March.
    13. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    14. 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.
    15. 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.
    16. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    17. 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.
    18. René van den Brink, 2009. "Comparable Axiomatizations of the Myerson Value, the Restricted Banzhaf Value, Hierarchical Outcomes and the Average Tree Solution for Cycle-Free Graph Restricted Games," Tinbergen Institute Discussion Papers 09-108/1, Tinbergen Institute.
    19. Norman L. Kleinberg & Jeffrey H. Weiss, 1985. "Equivalent N -Person Games and the Null Space of the Shapley Value," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 233-243, May.
    20. van den Brink, René, 2012. "Efficiency and collusion neutrality in cooperative games and networks," Games and Economic Behavior, Elsevier, vol. 76(1), pages 344-348.
    21. Mishra, D. & Talman, A.J.J., 2009. "A Characterization of the Average Tree Solution for Cycle-Free Graph Games," Discussion Paper 2009-17, Tilburg University, Center for Economic Research.
    22. Biung-Ghi Ju & Junghum Park, 2012. "Hierarchical Outcomes and Collusion Neutrality," Working Paper Series no87, Institute of Economic Research, Seoul National University.
    23. Rene van den Brink & Ilya Katsev & Gerard van der Laan, 2011. "Games on Union Closed Systems," Tinbergen Institute Discussion Papers 11-036/1, Tinbergen Institute.
    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. Sylvain Béal & André Casajus & Eric Rémila & Philippe Solal, 2021. "Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations," Annals of Operations Research, Springer, vol. 302(1), pages 23-47, July.
    2. 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.
    3. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    4. Sylvain Béal & André Casajus & Frank Huettner & Eric Rémila & Philippe Solal, 2016. "Characterizations of weighted and equal division values," Theory and Decision, Springer, vol. 80(4), pages 649-667, April.
    5. Özer Selçuk & Takamasa Suzuki, 2023. "Comparable axiomatizations of the average tree solution and the Myerson value," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 333-362, June.

    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. 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.
    2. 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.
    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. 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. 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.
    6. 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.
    7. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    8. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    9. 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.
    10. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    11. S. Béal & A. Lardon & E. Rémila & P. Solal, 2012. "The average tree solution for multi-choice forest games," Annals of Operations Research, Springer, vol. 196(1), pages 27-51, July.
    12. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    13. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    14. Özer Selçuk & Takamasa Suzuki, 2023. "Comparable axiomatizations of the average tree solution and the Myerson value," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 333-362, June.
    15. 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.
    16. Sylvain Béal & Sylvain Ferrières & Eric Rémila & Philippe Solal, 2017. "Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games," Post-Print halshs-01644797, HAL.
    17. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2023. "The two-step average tree value for graph and hypergraph games," Annals of Operations Research, Springer, vol. 323(1), pages 109-129, April.
    18. René Brink & Chris Dietz & Gerard Laan & Genjiu Xu, 2017. "Comparable characterizations of four solutions for permission tree games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(4), pages 903-923, April.
    19. 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.
    20. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2023. "The two-step average tree value for graph and hypergraph games," Annals of Operations Research, Springer, vol. 323(1), pages 109-129, April.

    More about this item

    Keywords

    Average Tree solution; Direct-sum decomposition; Kernel; Weighted addition invariance on bi-partitions; Invariance to irrelevant coalitions.;
    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:crb:wpaper:2014-04. 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: Lauent Kondratuk (email available below). General contact details of provider: https://edirc.repec.org/data/crufcfr.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.