IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/20130207.html
   My bibliography  Save this paper

Cooperative Games on Accessible Union Stable Systems

Author

Listed:
  • Encarnación Algaba

    (Escuela Técnica Superior de Ingenierá, Sevilla, Spain)

  • Rene van den Brink

    (VU University Amsterdam)

  • Chris Dietz

    (VU University Amsterdam)

Abstract

Agents participating in different kind of organizations, usually take different positions in some relational structure. The aim of this paper is to introduce a new framework taking into account both communication and hierachical features derived from this participation. In fact, this new set or network structure unifies and generalizes well-known models from the literature, such as communication networks and hierarchies. We introduce and analyze accessible union stable systems where union stability reflects the communication network and accessibility describes the hierarchy. Particular cases of these new structures are the sets of connected coalitions in a communication graph, antimatroids (and therefore also sets of feasible coalitions in permission structures) and augmenting systems which have numerous applications in the literature. We give special attention to th e class of cycle-free accessible union stable systems. We also consider cooperative games with restricted cooperation where the set of feasible coalitions is an accessible union stable system, and provide an axiomatization of an extension of the Shapley value to this class of games.

Suggested Citation

  • Encarnación Algaba & Rene van den Brink & Chris Dietz, 2013. "Cooperative Games on Accessible Union Stable Systems," Tinbergen Institute Discussion Papers 13-207/II, Tinbergen Institute.
  • Handle: RePEc:tin:wpaper:20130207
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/13207.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. Hamiache, Gerard, 1999. "A Value with Incomplete Communication," Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.
    2. Ambec, Stefan & Sprumont, Yves, 2002. "Sharing a River," Journal of Economic Theory, Elsevier, vol. 107(2), pages 453-462, December.
    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. Matthew O. Jackson & Tomas Rodriguez-Barraquer & Xu Tan, 2012. "Social Capital and Social Quilts: Network Patterns of Favor Exchange," American Economic Review, American Economic Association, vol. 102(5), pages 1857-1897, August.
    5. Imma Curiel & Jos Potters & Rajendra Prasad & Stef Tijs & Bart Veltman, 1994. "Sequencing and Cooperation," Operations Research, INFORMS, vol. 42(3), pages 566-568, June.
    6. van den Brink, Rene & Gilles, Robert P., 1996. "Axiomatizations of the Conjunctive Permission Value for Games with Permission Structures," Games and Economic Behavior, Elsevier, vol. 12(1), pages 113-126, January.
    7. Jesús Mario Bilbao & Julio R. Fernández & Nieves Jiménez & Jorge Jesús López, 2004. "The Shapley value for bicooperative games," Economic Working Papers at Centro de Estudios Andaluces E2004/56, Centro de Estudios Andaluces.
    8. Katsev, Ilya & Yanovskaya, Elena, 2013. "The prenucleolus for games with restricted cooperation," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 56-65.
    9. S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
    10. Ni, Debing & Wang, Yuntong, 2007. "Sharing a polluted river," Games and Economic Behavior, Elsevier, vol. 60(1), pages 176-186, July.
    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. René Brink, 2012. "On hierarchies and communication," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(4), pages 721-735, October.
    2. Juarez, Ruben & Ko, Chiu Yu & Xue, Jingyi, 2018. "Sharing sequential values in a network," Journal of Economic Theory, Elsevier, vol. 177(C), pages 734-779.
    3. René van den Brink, 2017. "Games with a Permission Structure: a survey on generalizations and applications," Tinbergen Institute Discussion Papers 17-016/II, Tinbergen Institute.
    4. René van den Brink, 2009. "Comparable Axiomatizations of the Myerson Value, the Restricted Banzhaf Value, Hierarchical Outcomes and the Average Tree Solution for Cycle-Free Graph Restricted Games," Tinbergen Institute Discussion Papers 09-108/1, Tinbergen Institute.
    5. 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.
    6. René Brink & P. Herings & Gerard Laan & A. Talman, 2015. "The Average Tree permission value for games with a permission tree," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 58(1), pages 99-123, January.
    7. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Tvede, Mich & Østerdal, Lars Peter, 2017. "Sharing the proceeds from a hierarchical venture," Games and Economic Behavior, Elsevier, vol. 102(C), pages 98-110.
    8. 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.
    9. Alcalde-Unzu, Jorge & Gómez-Rúa, María & Molis, Elena, 2015. "Sharing the costs of cleaning a river: the Upstream Responsibility rule," Games and Economic Behavior, Elsevier, vol. 90(C), pages 134-150.
    10. 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.
    11. René van den Brink & Simin He & Jia-Ping Huang, 2015. "Polluted River Problems and Games with a Permission Structure," Tinbergen Institute Discussion Papers 15-108/II, Tinbergen Institute.
    12. 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.
    13. René Brink & Chris Dietz, 2014. "Games with a local permission structure: separation of authority and value generation," Theory and Decision, Springer, vol. 76(3), pages 343-361, March.
    14. Encarnación Algaba & René Brink & Chris Dietz, 2018. "Network Structures with Hierarchy and Communication," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 265-282, October.
    15. Encarnacion Algaba & René van den Brink & Chris Dietz, 2015. "Power Measures and Solutions for Games under Precedence Constraints," Tinbergen Institute Discussion Papers 15-007/II, Tinbergen Institute.
    16. 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.
    17. Bryan S. Graham, 2016. "Homophily and transitivity in dynamic network formation," CeMMAP working papers CWP16/16, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    18. Carayol, Nicolas & Bergé, Laurent & Cassi, Lorenzo & Roux, Pascale, 2019. "Unintended triadic closure in social networks: The strategic formation of research collaborations between French inventors," Journal of Economic Behavior & Organization, Elsevier, vol. 163(C), pages 218-238.
    19. Dehez, Pierre & Ferey, Samuel, 2013. "How to share joint liability: A cooperative game approach," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 44-50.
    20. van den Brink, René & Katsev, Ilya & van der Laan, Gerard, 2010. "An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure," European Journal of Operational Research, Elsevier, vol. 207(2), pages 817-826, December.

    More about this item

    Keywords

    union stable system; accessibility; cooperative TU-game; Shapley value;

    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:tin:wpaper:20130207. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tinbergen Office +31 (0)10-4088900). General contact details of provider: http://edirc.repec.org/data/tinbenl.html .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.