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

Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games

Author

Listed:
  • Rafael Amer
  • José Giménez
  • Antonio Magaña

Abstract

The aim of this paper consists of constructing accessibility measures to the nodes of directed graphs using methods of Game Theory. Since digraphs without a predefined game are considered, the main part of the paper is devoted to establish conditions on cooperative games so that they can be used to measure accessibility. Games that satisfy desirable properties are called test games. Each ranking on the nodes is then obtained according to a pair formed by a test game and a solution defined on cooperative games whose utilities are given on ordered coalitions. The solutions proposed here are extensions of the wide family of semivalues to games in generalized characteristic function form. Copyright Springer-Verlag 2012

Suggested Citation

  • Rafael Amer & José Giménez & Antonio Magaña, 2012. "Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(1), pages 105-134, February.
    • Handle: RePEc:spr:mathme:v:75:y:2012:i:1:p:105-134
    DOI: 10.1007/s00186-011-0378-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-011-0378-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-011-0378-x?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.

    References listed on IDEAS

    as
    1. Laffond G. & Laslier J. F. & Le Breton M., 1993. "The Bipartisan Set of a Tournament Game," Games and Economic Behavior, Elsevier, vol. 5(1), pages 182-201, January.
    2. Gilles, Robert P & Owen, Guillermo & van den Brink, Rene, 1992. "Games with Permission Structures: The Conjunctive Approach," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 277-293.
    3. P. Herings & Gerard Laan & Dolf Talman, 2005. "The positional power of nodes in digraphs," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 24(3), pages 439-454, June.
    4. René van den Brink & Peter Borm, 2002. "Digraph Competitions and Cooperative Games," Theory and Decision, Springer, vol. 53(4), pages 327-342, December.
    5. Rafael Amer & José Miguel giménez, 2003. "Modification of Semivalues for Games with Coalition Structures," Theory and Decision, Springer, vol. 54(3), pages 185-205, May.
    6. Gerard van der Laan & René van den Brink, 1998. "Axiomatization of a class of share functions for n-person games," Theory and Decision, Springer, vol. 44(2), pages 117-148, April.
    7. Derks, Jean J M & Gilles, Robert P, 1995. "Hierarchical Organization Structures and Constraints on Coalition Formation," International Journal of Game Theory, Springer;Game Theory Society, vol. 24(2), pages 147-163.
    8. Pradeep Dubey & Abraham Neyman & Robert James Weber, 1981. "Value Theory Without Efficiency," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 122-128, February.
    9. Nowak Andrzej S. & Radzik Tadeusz, 1994. "The Shapley Value for n-Person Games in Generalized Characteristic Function Form," Games and Economic Behavior, Elsevier, vol. 6(1), pages 150-161, January.
    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. 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.
    2. René Brink, 2017. "Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 1-33, April.
    3. 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.
    4. Michel Grabisch & Peter Sudhölter, 2012. "The bounded core for games with precedence constraints," Annals of Operations Research, Springer, vol. 201(1), pages 251-264, December.
    5. Derks, Jean & Peters, Hans, 1997. "Consistent restricted Shapley values," Mathematical Social Sciences, Elsevier, vol. 33(1), pages 75-91, February.
    6. René Brink & Frank Steffen, 2012. "Axiomatizations of a positional power score and measure for hierarchies," Public Choice, Springer, vol. 151(3), pages 757-787, June.
    7. Pulido, Manuel A. & Sanchez-Soriano, Joaquin, 2006. "Characterization of the core in games with restricted cooperation," European Journal of Operational Research, Elsevier, vol. 175(2), pages 860-869, December.
    8. Borm, Peter & van den Brink, Rene & Levinsky, Rene & Slikker, Marco, 2004. "On two new social choice correspondences," Mathematical Social Sciences, Elsevier, vol. 47(1), pages 51-68, January.
    9. Faigle, U. & Grabisch, M. & Heyne, M., 2010. "Monge extensions of cooperation and communication structures," European Journal of Operational Research, Elsevier, vol. 206(1), pages 104-110, October.
    10. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    11. Peter Borm & René van den Brink & Marco Slikker, 2002. "An Iterative Procedure for Evaluating Digraph Competitions," Annals of Operations Research, Springer, vol. 109(1), pages 61-75, January.
    12. Hao Wu & Rene van den Brink & Arantza Estevez-Fernandez, 2022. "The locally partial permission value for games with a permission structure," Tinbergen Institute Discussion Papers 22-037/II, Tinbergen Institute.
    13. Michel Grabisch & Agnieszka Rusinowska, 2010. "A model of influence in a social network," Theory and Decision, Springer, vol. 69(1), pages 69-96, July.
    14. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 189-208, April.
    15. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Other publications TiSEM 00f2df6e-3a8e-4ed3-84cf-2, Tilburg University, School of Economics and Management.
    16. P. Herings & Gerard Laan & Dolf Talman, 2007. "Socially Structured Games," Theory and Decision, Springer, vol. 62(1), pages 1-29, February.
    17. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    18. Herings, P. Jean-Jacques & van der Laan, Gerard & Talman, Dolf, 2007. "The socially stable core in structured transferable utility games," Games and Economic Behavior, Elsevier, vol. 59(1), pages 85-104, April.
    19. Calvo, Emilio & Santos, Juan Carlos, 1997. "Potentials in cooperative TU-games," Mathematical Social Sciences, Elsevier, vol. 34(2), pages 175-190, October.
    20. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2001. "Measuring the Power of Nodes in Digraphs," Other publications TiSEM 8ad1bdb1-a602-4674-b737-2, Tilburg University, School of Economics and Management.
    21. Amer, Rafael & Gimenez, Jose Miguel, 2007. "The two-person blocks as a way to emphasize several semivalues," Mathematical Social Sciences, Elsevier, vol. 53(2), pages 172-184, March.

    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:75:y:2012:i:1:p:105-134. 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: 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.