IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v91y2024ics0038012123002951.html
   My bibliography  Save this article

Measuring productivity in networks: A game-theoretic approach

Author

Listed:
  • Allouch, N.
  • Guardiola, Luis A.
  • Meca, A.

Abstract

Measuring individual productivity (or equivalently distributing the overall productivity) in a network structure of workers displaying peer effects has been a subject of ongoing interest in many areas ranging from academia to industry. In this paper, we propose a novel approach based on cooperative game theory that takes into account the peer effects of worker productivity represented by a complete bipartite network of interactions. More specifically, we construct a series of cooperative games where the characteristic function of each coalition of workers is equal to the sum of each worker intrinsic productivity as well as the productivity of other workers within a distance discounted by an attenuation factor. We show that these (truncated) games are balanced and converge to a balanced game when the distance of influence grows large. We then provide an explicit formula for the Shapley value and propose an alternative coalitionally stable distribution of productivity which is computationally much more tractable than the Shapley value. Lastly, we characterize this alternative distribution based on three sensible properties of a logistic network. This analysis enhances our understanding of game-theoretic analysis within logistics networks, offering valuable insights into the peer effects’ impact when assessing the overall productivity and its distribution among workers.

Suggested Citation

  • Allouch, N. & Guardiola, Luis A. & Meca, A., 2024. "Measuring productivity in networks: A game-theoretic approach," Socio-Economic Planning Sciences, Elsevier, vol. 91(C).
  • Handle: RePEc:eee:soceps:v:91:y:2024:i:c:s0038012123002951
    DOI: 10.1016/j.seps.2023.101783
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012123002951
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.seps.2023.101783?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. Yann Bramoullé & Habiba Djebbari & Bernard Fortin, 2020. "Peer Effects in Networks: A Survey," Annual Review of Economics, Annual Reviews, vol. 12(1), pages 603-629, August.
    2. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    3. Belik, Ivan & Jörnsten, Kurt, 2016. "The method of leader's overthrow in networks based on Shapley value," Socio-Economic Planning Sciences, Elsevier, vol. 56(C), pages 55-66.
    4. Lloyd S. Shapley, 1967. "On balanced sets and cores," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(4), pages 453-460.
    5. 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.
    6. 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.
    7. Marco Slikker, 2005. "Link Monotonic Allocation Schemes," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
    8. Xiaotie Deng & Christos H. Papadimitriou, 1994. "On the Complexity of Cooperative Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 19(2), pages 257-266, May.
    9. Belik, Ivan & Jörnsten, Kurt, 2016. "The Method of Leader’s Overthrow in Networks," Discussion Papers 2016/1, Norwegian School of Economics, Department of Business and Management Science.
    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. Chessa, Michela & Ciardiello, Francesco & Martinez, Ricardo & Meca, Ana & Saulle, Riccardo D., 2024. "Foreword for the special issue: “Decision-Making Models for Common Goods in Environmental, Health, and Logistics Contexts”," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).

    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. 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.
    3. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    4. Gabrielle Demange, 2017. "The stability of group formation," Revue d'économie politique, Dalloz, vol. 127(4), pages 495-516.
    5. 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 131-150, May.
    6. Béal, Sylvain & Ferrières, Sylvain & Rémila, Eric & Solal, Philippe, 2018. "The proportional Shapley value and applications," Games and Economic Behavior, Elsevier, vol. 108(C), pages 93-112.
    7. Hellman, Ziv & Peretz, Ron, 2018. "Values for cooperative games over graphs and games with inadmissible coalitions," Games and Economic Behavior, Elsevier, vol. 108(C), pages 22-36.
    8. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    9. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
    10. Dylan Laplace Mermoud & Michel Grabisch & Peter Sudhölter, 2021. "Algorithmic aspects of core nonemptiness and core stability," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03354292, HAL.
    11. Demange, Gabrielle, 2024. "Stable outcomes in simple cooperative games," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    12. 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.
    13. 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.
    14. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    15. Moshe Babaioff & Uriel Feige, 2019. "A New Approach to Fair Distribution of Welfare," Papers 1909.11346, arXiv.org.
    16. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, March.
    17. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    18. Sudhölter, Peter & Grabisch, Michel & Laplace Mermoud, Dylan, 2022. "Core stability and other applications of minimal balanced collections," Discussion Papers on Economics 4/2022, University of Southern Denmark, Department of Economics.
    19. Guang Zhang & Erfang Shan & Liying Kang & Yanxia Dong, 2017. "Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 462-482, August.
    20. Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022. "Early contributors, cooperation and fair rewards in crowdfunding," Working Papers hal-04222321, HAL.

    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:soceps:v:91:y:2024:i:c:s0038012123002951. 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/seps .

    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.