IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v93y2018icp132-140.html
   My bibliography  Save this article

Axiomatization of an allocation rule for ordered tree TU-games

Author

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

Abstract

We introduce the class of tree TU-games augmented by a linear order over the links, which reflects the formation process of the tree. We characterize a new allocation rule for this class of cooperative games by means of three axioms: Standardness, Top consistency and Link amalgamation. Then, we discuss both a bargaining foundation and two possible extensions for this allocation rule.

Suggested Citation

  • Béal, Sylvain & Ferrières, Sylvain & Rémila, Eric & Solal, Philippe, 2018. "Axiomatization of an allocation rule for ordered tree TU-games," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 132-140.
    • Handle: RePEc:eee:matsoc:v:93:y:2018:i:c:p:132-140
    DOI: 10.1016/j.mathsocsci.2018.03.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489618300209
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2018.03.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Yuan Ju & Peter Borm & Pieter Ruys, 2007. "The consensus value: a new solution concept for cooperative games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 685-703, June.
    3. Erik Ansink & Hans-Peter Weikard, 2012. "Sequential sharing rules for river sharing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(2), pages 187-210, February.
    4. Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "A strategic implementation of the sequential equal surplus division rule for digraph cooperative games," Annals of Operations Research, Springer, vol. 253(1), pages 43-59, June.
    5. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    6. 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.
    7. 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.
    8. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
    9. 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.
    10. Calvo-Armengol, Antoni, 2001. "Bargaining power in communication networks," Mathematical Social Sciences, Elsevier, vol. 41(1), pages 69-87, January.
    11. Philippe Solal & Sylvain Béal & Sylvain Ferrières & Eric Rémila, 2017. "Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games," Post-Print halshs-01644811, HAL.
    12. Lehrer, E, 1988. "An Axiomatization of the Banzhaf Value," International Journal of Game Theory, Springer;Game Theory Society, vol. 17(2), pages 89-99.
    13. Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Other publications TiSEM 5a8473e4-1df7-42df-ad53-f, Tilburg University, School of Economics and Management.
    14. Anna Khmelnitskaya, 2010. "Values for rooted-tree and sink-tree digraph games and sharing a river," Theory and Decision, Springer, vol. 69(4), pages 657-669, October.
    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. Navarro Noemí & Perea Andres, 2013. "A Simple Bargaining Procedure for the Myerson Value," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 13(1), pages 1-20, May.
    17. Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
    18. Abreu, Dilip & Manea, Mihai, 2012. "Bargaining and efficiency in networks," Journal of Economic Theory, Elsevier, vol. 147(1), pages 43-70.
    19. Yukihiko Funaki & Takehiko Yamato, 2001. "The Core And Consistency Properties: A General Characterisation," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 3(02n03), pages 175-187.
    20. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    21. Alonso-Meijide, J.M. & Álvarez-Mozos, M. & Fiestras-Janeiro, M.G., 2009. "Values of games with graph restricted communication and a priori unions," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 202-213, September.
    22. Gary Hamel, 1991. "Competition for competence and interpartner learning within international strategic alliances," Strategic Management Journal, Wiley Blackwell, vol. 12(S1), pages 83-103, June.
    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. Xun-Feng Hu & Deng-Feng Li, 2021. "The Equal Surplus Division Value for Cooperative Games with a Level Structure," Group Decision and Negotiation, Springer, vol. 30(6), pages 1315-1341, December.

    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. 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.
    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, 2012. "The sequential equal surplus division for sharing a river," MPRA Paper 37346, University Library of Munich, Germany.
    4. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, July.
    5. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    6. Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "A strategic implementation of the sequential equal surplus division rule for digraph cooperative games," Annals of Operations Research, Springer, vol. 253(1), pages 43-59, June.
    7. 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.
    8. 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.
    9. 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.
    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. 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.
    12. 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.
    13. 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.
    14. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    15. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    16. 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.
    17. 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.
    18. 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.
    19. Khmelnitskaya, A. & Talman, A.J.J., 2011. "Two solution concepts for TU games with cycle-free directed cooperation structures," Other publications TiSEM df61db11-45de-42b3-91e6-9, Tilburg University, School of Economics and Management.
    20. Sylvain Béal & Anna Khmelnitskaya & Philippe Solal, 2018. "Two-step values for games with two-level communication structure," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 563-587, February.

    More about this item

    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:eee:matsoc:v:93:y:2018:i:c:p:132-140. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.