IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2402.11464.html
   My bibliography  Save this paper

Weighted Myerson value for Network games

Author

Listed:
  • Niharika Kakoty
  • Surajit Borkotokey
  • Rajnish Kumar
  • Abhijit Bora

Abstract

We study the weighted Myerson value for Network games extending a similar concept for communication situations. Network games, unlike communication situations, treat direct and indirect links among players differently and distinguish their effects in both worth generation and allocation processes. The weighted Myerson value is an allocation rule for Network games that generalizes the Myerson value of Network games. Here, the players are assumed to have some weights measuring their capacity to form links with other players. Two characterization of the weighted Myerson value are provided. Finally, we propose a bidding mechanism to show that the weighted Myerson value is a subgame-perfect Nash equilibrium under a non-cooperative framework.

Suggested Citation

  • Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    • Handle: RePEc:arx:papers:2402.11464
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2402.11464
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Winter, Eyal, 1992. "The consistency and potential for values of games with coalition structure," Games and Economic Behavior, Elsevier, vol. 4(1), pages 132-144, January.
    2. 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.
    3. Marco Slikker, 2005. "A characterization of the position value," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 505-514, November.
    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. Haeringer, Guillaume, 2006. "A new weight scheme for the Shapley value," Mathematical Social Sciences, Elsevier, vol. 52(1), pages 88-98, July.
    6. Manuel, C. & Ortega, E. & del Pozo, M., 2020. "Marginality and Myerson values," European Journal of Operational Research, Elsevier, vol. 284(1), pages 301-312.
    7. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    8. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    9. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    10. Ghintran, Amandine, 2013. "Weighted position values," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 157-163.
    11. 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.
    12. Jean-François Caulier & Alexandre Skoda & Emily Tanimura, 2017. "Allocation Rules for Networks Inspired by Cooperative Game-Theory," Revue d'économie politique, Dalloz, vol. 127(4), pages 517-558.
    13. Casajus, André & Huettner, Frank, 2014. "Weakly monotonic solutions for cooperative games," Journal of Economic Theory, Elsevier, vol. 154(C), pages 162-172.
    14. Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
    15. Marco Slikker, 2005. "Link Monotonic Allocation Schemes," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
    16. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    17. Borkotokey, Surajit & Kumar, Rajnish & Sarangi, Sudipta, 2015. "A solution concept for network games: The role of multilateral interactions," European Journal of Operational Research, Elsevier, vol. 243(3), pages 912-920.
    18. Hart, Sergiu & Mas-Colell, Andreu, 1996. "Bargaining and Value," Econometrica, Econometric Society, vol. 64(2), pages 357-380, March.
    19. Ruiz, Luis M. & Valenciano, Federico & Zarzuelo, Jose M., 1998. "The Family of Least Square Values for Transferable Utility Games," Games and Economic Behavior, Elsevier, vol. 24(1-2), pages 109-130, July.
    20. Casajus, André & Huettner, Frank, 2013. "Null players, solidarity, and the egalitarian Shapley values," Journal of Mathematical Economics, Elsevier, vol. 49(1), pages 58-61.
    21. Guillermo Owen, 1968. "Communications to the Editor--A Note on the Shapley Value," Management Science, INFORMS, vol. 14(11), pages 731-731, July.
    22. René Brink & Yukihiko Funaki & Yuan Ju, 2013. "Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 693-714, March.
    23. Guillaume Haeringer, 1999. "Weighted Myerson Value," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 1(02), pages 187-192.
    24. van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
    25. Nowak, A.S. & Radzik, T., 1995. "On axiomatizations of the weighted Shapley values," Games and Economic Behavior, Elsevier, vol. 8(2), pages 389-405.
    26. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    Full references (including those not matched with items on IDEAS)

    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. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    2. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
    3. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    4. C. Manuel & D. Martín, 2021. "A value for communication situations with players having different bargaining abilities," Annals of Operations Research, Springer, vol. 301(1), pages 161-182, June.
    5. Borkotokey, Surajit & Kumar, Rajnish & Sarangi, Sudipta, 2015. "A solution concept for network games: The role of multilateral interactions," European Journal of Operational Research, Elsevier, vol. 243(3), pages 912-920.
    6. Julia Belau, 2018. "The class of ASN-position values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 65-99, January.
    7. Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021. "Probabilistic network values," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.
    8. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    9. van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
    10. repec:hal:pseose:halshs-01207823 is not listed on IDEAS
    11. 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.
    12. Ghintran, Amandine, 2013. "Weighted position values," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 157-163.
    13. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    14. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    15. Zijun Li & Fanyong Meng, 2023. "The α-Egalitarian Myerson value of games with communication structure," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 311-338, June.
    16. Surajit Borkotokey & Loyimee Gogoi & Sudipta Sarangi, 2014. "A Survey of Player-based and Link-based Allocation Rules for Network Games," Studies in Microeconomics, , vol. 2(1), pages 5-26, June.
    17. Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "Axiomatization and implementation of a class of solidarity values for TU-games," Theory and Decision, Springer, vol. 83(1), pages 61-94, June.
    18. Borkotokey, Surajit & Sarangi, Sudipta, 2011. "Allocation rules for fixed and flexible networks: the role of players and their links," MPRA Paper 38340, University Library of Munich, Germany.
    19. González–Arangüena, E. & Manuel, C. & Owen, G. & del Pozo, M., 2017. "The within groups and the between groups Myerson values," European Journal of Operational Research, Elsevier, vol. 257(2), pages 586-600.
    20. 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.
    21. 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.

    More about this item

    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:arx:papers:2402.11464. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.