IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v60y2004i3p453-470.html
   My bibliography  Save this article

A connectivity game for graphs

Author

Listed:
  • Rafael Amer
  • José Miguel Giménez

Abstract

The introduction of a {0,1}-valued game associated to a connected graph allows us to assign to each vertex a value of weighted connectivity according to the different solutions that for cooperative games are obtained by means of semivalues. The marginal contributions of each vertex to the coalitions differentiate an active connectivity from another reactive connectivity, according to whether the vertex is essential to obtain the connection or is the obstacle for the connection between the vertices in the coalition. We offer general properties of the connectivity, as well as the behaviour of different families of graphs with regard to this concept. We also analyse the effect on different vertices due to the addition of an edge to the initial graph. Copyright Springer-Verlag 2004

Suggested Citation

  • Rafael Amer & José Miguel Giménez, 2004. "A connectivity game for graphs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 60(3), pages 453-470, December.
  • Handle: RePEc:spr:mathme:v:60:y:2004:i:3:p:453-470
    DOI: 10.1007/s001860400356
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400356
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s001860400356?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 search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ramón Flores & Elisenda Molina & Juan Tejada, 2019. "Evaluating groups with the generalized Shapley value," 4OR, Springer, vol. 17(2), pages 141-172, June.
    2. Amer, Rafael & Gimenez, Jose Miguel & Magana, Antonio, 2007. "Accessibility in oriented networks," European Journal of Operational Research, Elsevier, vol. 180(2), pages 700-712, July.
    3. Husslage, B.G.M. & Lindelauf, R. & Hamers, H.J.M., 2012. "Leaderless Covert Networks : A Quantitative Approach," Discussion Paper 2012-057, Tilburg University, Center for Economic Research.
    4. Flores Díaz, Ramón Jesús & Molina, Elisenda & Tejada, Juan, 2013. "The Shapley group value," DES - Working Papers. Statistics and Econometrics. WS ws133430, Universidad Carlos III de Madrid. Departamento de Estadística.
    5. Giulia Cesari & Roberto Lucchetti & Stefano Moretti, 2017. "Generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 919-939, November.
    6. Lindelauf, R. & Hamers, H.J.M. & Husslage, B.G.M., 2011. "Game Theoretic Centrality Analysis of Terrorist Networks : The Cases of Jemaah Islamiyah and Al Qaeda," Discussion Paper 2011-107, Tilburg University, Center for Economic Research.
    7. Lindelauf, R. & Hamers, H.J.M. & Husslage, B.G.M., 2011. "Game Theoretic Centrality Analysis of Terrorist Networks : The Cases of Jemaah Islamiyah and Al Qaeda," Other publications TiSEM e91f6269-bcac-4790-b42f-3, Tilburg University, School of Economics and Management.
    8. Tom C. van der Zanden & Hans L. Bodlaender & Herbert J. M. Hamers, 2023. "Efficiently computing the Shapley value of connectivity games in low-treewidth graphs," Operational Research, Springer, vol. 23(1), pages 1-23, March.
    9. Husslage, B.G.M. & Lindelauf, R. & Hamers, H.J.M., 2012. "Leaderless Covert Networks : A Quantitative Approach," Other publications TiSEM c4111fba-0f6c-42cd-976a-1, Tilburg University, School of Economics and Management.
    10. Lindelauf, R.H.A. & Hamers, H.J.M. & Husslage, B.G.M., 2013. "Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda," European Journal of Operational Research, Elsevier, vol. 229(1), pages 230-238.
    11. Stefano Moretti & Henk Norde, 2022. "Some new results on generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 87-118, March.

    More about this item

    Keywords

    Cooperative game; Graph; Connectivity; Semivalue; 91A12; 91A43;
    All these keywords.

    JEL classification:

    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:spr:mathme:v:60:y:2004:i:3:p:453-470. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.