IDEAS home Printed from https://ideas.repec.org/p/crb/wpaper/2026-08.html

Allocation rules for network games with local considerations

Author

Listed:
  • Sylvain Béal

    (Université Marie et Louis Pasteur, CRESE UR3190, F-25000 Besançon, France)

  • Emmanuelle Lebeuf

    (Université Marie et Louis Pasteur, F-25000 Besançon, France)

  • Kevin Techer

    (Université Marie et Louis Pasteur, CRESE UR3190, F-25000 Besançon, France)

Abstract

We introduce a new allocation rule for network games that combines a local component and a global component. The local component depends only on the links incident to each player, whereas the global component allocates a surplus equally among the members of each connected component. We characterize this allocation rule by three classical axioms together with a new axiom, Fairness under Neighborhood Restriction, which requires that two adjacent players experience the same payoff variation when the network is restricted to their local neighborhoods, that is, to the sets of links incident to each player. We also examine an alternative allocation rule that differs only in its global component, distributing the surplus within each connected component in proportion to players’ degrees in the network.

Suggested Citation

  • Sylvain Béal & Emmanuelle Lebeuf & Kevin Techer, 2026. "Allocation rules for network games with local considerations," Working Papers 2026-08, CRESE.
    • Handle: RePEc:crb:wpaper:2026-08
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    2. 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.
    3. 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.
    4. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    5. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    6. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    7. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    8. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
    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, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    3. 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.
    4. Jackson, Matthew O. & Zenou, Yves, 2015. "Games on Networks," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
    6. Matthew Elliott & Arun Chandrasekhar & Attila Ambrus, 2015. "Social Investments, Informal Risk Sharing, and Inequality," 2015 Meeting Papers 189, Society for Economic Dynamics.
    7. Parishmita Boruah & Niharika Kakoty & Surajit Borkotokey, 2025. "The k-Egalitarian Myerson Values: Characterizations and Implementation," SN Operations Research Forum, Springer, vol. 6(1), pages 1-25, March.
    8. Subhadip Chakrabarti & Loyimee Gogoi & Robert P. Gilles & Surajit Borkotokey & Rajnish Kumar, 2024. "Expected values for variable network games," Annals of Operations Research, Springer, vol. 336(3), pages 2061-2089, May.
    9. Attila Ambrus & Arun G. Chandrasekhar & Matt Elliott, 2014. "Social Investments, Informal Risk Sharing, and Inequality," NBER Working Papers 20669, National Bureau of Economic Research, Inc.
    10. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    11. Caulier, Jean-François & Mauleon, Ana & Vannetelbosch, Vincent, 2015. "Allocation rules for coalitional network games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 80-88.
    12. Zenou, Yves, 2012. "Networks in Economics," CEPR Discussion Papers 9021, Centre for Economic Policy Research.
    13. de Marti, Joan & Zenou, Yves, 2009. "Social Networks," Working Paper Series 816, Research Institute of Industrial Economics.
    14. 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.
    15. Swapnil Dhamal & Y. Narahari, 2015. "Formation of Stable Strategic Networks with Desired Topologies," Studies in Microeconomics, , vol. 3(2), pages 158-213, December.
    16. Newton, Jonathan, 2012. "Coalitional stochastic stability," Games and Economic Behavior, Elsevier, vol. 75(2), pages 842-854.
    17. Carayol, Nicolas & Delille, Rémy & Vannetelbosch, Vincent, 2015. "Allocating value among farsighted players in network formation," Economics Letters, Elsevier, vol. 137(C), pages 50-53.
    18. Joss Sánchez-Pérez, 2019. "Solutions for network games and symmetric group representations," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(4), pages 95-123.
    19. Navarro, Noemí, 2010. "Flexible network rules for identified externalities," Games and Economic Behavior, Elsevier, vol. 69(2), pages 401-410, July.
    20. P. Herings & Gerard Laan & Dolf Talman, 2007. "Socially Structured Games," Theory and Decision, Springer, vol. 62(1), pages 1-29, February.

    More about this item

    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:2026-08. 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: Laurent 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.