IDEAS home Printed from https://ideas.repec.org/a/sae/ratsoc/v9y1997i1p37-65.html
   My bibliography  Save this article

Network Exchange As A Cooperative Game

Author

Listed:
  • Elisa Jayne Bienenstock
  • Phillip Bonacich

Abstract

This paper presents parallels between network exchange experiments and N -person cooperative games with transferable utility, to show how game theory can assist network exchange researchers, not only in predicting outcomes, but in properly specifying the scope of their models. It illustrates how utility, strategy and c-games , concepts found in game theory, could be used by exchange theorists to help them reflect on their models and improve their research design. One game theoretic solution concept, the kernel, is compared to recent network exchange algorithms as an illustration of how easy it is to apply game theory to the exchange network situation. It also illustrates some advantages of using a game theory solution concept to model network exchange.

Suggested Citation

  • Elisa Jayne Bienenstock & Phillip Bonacich, 1997. "Network Exchange As A Cooperative Game," Rationality and Society, , vol. 9(1), pages 37-65, February.
  • Handle: RePEc:sae:ratsoc:v:9:y:1997:i:1:p:37-65
    DOI: 10.1177/104346397009001002
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/104346397009001002
    Download Restriction: no

    File URL: https://libkey.io/10.1177/104346397009001002?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
    ---><---

    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.
    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. Falk Armin & Kosfeld Michael, 2012. "It's all about Connections: Evidence on Network Formation," Review of Network Economics, De Gruyter, vol. 11(3), pages 1-36, September.
    2. Messan Agbaglah, 2017. "Overlapping coalitions, bargaining and networks," Theory and Decision, Springer, vol. 82(3), pages 435-459, March.
    3. Rodrigo J. Harrison & Roberto Munoz, 2003. "Stability and Equilibrium Selection in a Link Formation Game," Game Theory and Information 0306004, University Library of Munich, Germany.
    4. Matthew O. Jackson, 2003. "A Survey of Models of Network Formation: Stability and Efficiency," Game Theory and Information 0303011, University Library of Munich, Germany.
    5. Matthew O. Jackson, 2002. "The Stability and Efficiency of Economic and Social Networks," Microeconomics 0211011, University Library of Munich, Germany.
    6. Michael Kosfeld, "undated". "Network Experiments," IEW - Working Papers 152, Institute for Empirical Research in Economics - University of Zurich.
    7. Elisa Jayne Bienenstock, 1997. "Response To `Network Games'," Rationality and Society, , vol. 9(3), pages 378-382, August.
    8. Phillip Bonacich, 1997. "Explanation And Prediction," Rationality and Society, , vol. 9(3), pages 373-377, August.

    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. 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.
    2. Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022. "Early contributors, cooperation and fair rewards in crowdfunding," Working Papers hal-04222321, HAL.
    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. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 16019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    5. Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024. "Cooperative games with diversity constraints," Working Papers hal-04447373, HAL.
    6. Rodrigo J. Harrison & Roberto Munoz, 2003. "Stability and Equilibrium Selection in a Link Formation Game," Game Theory and Information 0306004, University Library of Munich, Germany.
    7. Sergio Currarini & Carmen Marchiori & Alessandro Tavoni, 2016. "Network Economics and the Environment: Insights and Perspectives," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 65(1), pages 159-189, September.
    8. 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.
    9. 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.
    10. H. Andrew Michener & Daniel J. Myers, 1998. "Probabilistic Coalition Structure Theories," Journal of Conflict Resolution, Peace Science Society (International), vol. 42(6), pages 830-860, December.
    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. Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
    13. László Á. Kóczy, 2016. "Power Indices When Players can Commit to Reject Coalitions," Homo Oeconomicus: Journal of Behavioral and Institutional Economics, Springer, vol. 33(1), pages 77-91, August.
    14. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    15. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    16. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    17. Hadas, Yuval & Gnecco, Giorgio & Sanguineti, Marcello, 2017. "An approach to transportation network analysis via transferable utility games," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 120-143.
    18. Alexandre Skoda & Xavier Venel, 2022. "Weighted Average-convexity and Cooperative Games," Documents de travail du Centre d'Economie de la Sorbonne 22016, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    19. Arcaute, E. & Dyagilev, K. & Johari, R. & Mannor, S., 2013. "Dynamics in tree formation games," Games and Economic Behavior, Elsevier, vol. 79(C), pages 1-29.
    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.

    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:sae:ratsoc:v:9:y:1997:i:1:p:37-65. 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: SAGE Publications (email available below). General contact details of provider: .

    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.