IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this paper

Games with a Permission Structure: a survey on generalizations and applications

Listed author(s):
  • René van den Brink

    ()

    (VU University Amsterdam, The Netherlands)

In the field of cooperative games with restricted cooperation, various restrictions on coalition formation are studied. The most studied restrictions are those that arise from restricted communication and hierarchies. This survey discusses several models of hierarchy restrictions and their relation with communication restrictions. In the literature, there are results on game properties, Harsanyi dividends, core stability, and various solutions that generalize exisiting solutions for TU-games. In this survey we mainly focus on axiomatizations of the Shapley value in different models of games with a hierarchically structured player set, and their applications. Not only do these axiomatizations provide insight in the Shapley value for these models, but also by considering the types of axioms that characterize the Shapley value, we learn more about different network structures. A central model of games with hierarchies are the games with a permission structure where players in a cooperative transferable utility game are part of a permission structure in the sense that there are players that need permission from other players before they are allowed to cooperate. This permission structure is represented by a directed graph. Generalizations of this model are, for example, games on antimatroids, and games with a local permission structure. Besides discussing these generalizations, we briefly discuss some applications, in particular auction games and hierarchically structured firms.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://papers.tinbergen.nl/17016.pdf
Download Restriction: no

Paper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 17-016/II.

as
in new window

Length:
Date of creation: 30 Jan 2017
Handle: RePEc:tin:wpaper:20170016
Contact details of provider: Postal:
Gustav Mahlerplein 117, 1082 MS Amsterdam

Phone: +31 (0)20 598 4580
Web page: http://www.tinbergen.nl/
Email:


More information through EDIRC

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as
in new window


  1. 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.
  2. Haller, Hans, 1994. "Collusion Properties of Values," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(3), pages 261-281.
  3. Lange, Fabien & Grabisch, Michel, 2009. "Values on regular games under Kirchhoff's laws," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 322-340, November.
  4. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.
  5. Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2005. "Strongly essential coalitions and the nucleolus of peer group games," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 447-460, September.
  6. René Brink & Ilya Katsev & Gerard Laan, 2011. "A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 591-616, August.
  7. Endre Bjørndal & Herbert Hamers & Maurice Koster, 2004. "Cost allocation in a bank ATM network," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 405-418, July.
  8. 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.
  9. Pieter H.M. Ruys & René van den Brink & Radislav Semenov, 2000. "Values and governance systems," Chapters,in: Institutions, Contracts and Organizations, chapter 27 Edward Elgar Publishing.
  10. E. Algaba & J. M. Bilbao & P. Borm & J. J. López, 2001. "The Myerson value for union stable structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(3), pages 359-371, December.
  11. 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.
  12. 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.
  13. 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.
  14. Baomin Dong & Debing Ni & Yuntong Wang, 2012. "Sharing a Polluted River Network," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 53(3), pages 367-387, November.
  15. 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.
  16. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.
  17. René Brink, 2010. "Axiomatizations of Banzhaf permission values for games with a permission structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 445-466, July.
  18. Bilbao, J.M. & Ordóñez, M., 2009. "Axiomatizations of the Shapley value for games on augmenting systems," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1008-1014, August.
  19. 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)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:tin:wpaper:20170016. 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)

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.