IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

The average tree permission value for games with a permission tree

  • Brink J.R. van den
  • Talman A.J.J.
  • Herings P.J.J.
  • Laan G. van der

    (GSBE)

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we consider such sets of feasible coalitions that follow from a permission structure on the set of players, in which players need permission to cooperate with other players. We assume the permission structure to be an oriented tree. This means that there is one player at the top of the permission structure and for every other player there is a unique directed path from the top player to this player. We introduce a new solution for these games based on the idea of the Average Tree value for cycle-free communication graph games. We provide two axiomatizations for this new value and compare it with the conjunctive permission value.

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://pub.maastrichtuniversity.nl/257dddc2-1219-42af-9a7e-785efef9a5f3
Download Restriction: no

Paper provided by Maastricht University, Graduate School of Business and Economics (GSBE) in its series Research Memorandum with number 001.

as
in new window

Length:
Date of creation: 2013
Date of revision:
Handle: RePEc:unm:umagsb:2013001
Contact details of provider: Postal: P.O. Box 616, 6200 MD Maastricht
Phone: +31 (0)43 38 83 830
Web page: http://www.maastrichtuniversity.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. Wouter Dessein, 2000. "Authority and Communication in Organizations," Econometric Society World Congress 2000 Contributed Papers 1747, Econometric Society.
  2. van den Brink, J.R. & Gilles, R.P., 1991. "Axiomatizations of the conjunctive permission value for games with permission structures," Research Memorandum FEW 485, Tilburg University, School of Economics and Management.
  3. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer, vol. 33(2), pages 349-364, November.
  4. Yair Tauman & Naoki Watanabe, 2007. "The Shapley Value of a Patent Licensing Game: the Asymptotic Equivalence to Non-cooperative Results," Economic Theory, Springer, vol. 30(1), pages 135-149, January.
  5. Gilles, R.P. & Owen, G. & van den Brink, J.R., 1991. "Games with permission structures : The conjunctive approach," Research Memorandum FEW 473, Tilburg University, School of Economics and Management.
  6. Oliver Hart & John Moore, 1999. "On the Design of Hierarchies: Coordination Versus Specialization," NBER Working Papers 7388, National Bureau of Economic Research, Inc.
  7. Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
  8. Mathias Dewatripont & Jean Tirole, 2005. "Modes of Communication," Journal of Political Economy, University of Chicago Press, vol. 113(6), pages 1217-1238, December.
  9. Bolton, Patrick & Dewatripont, Mathias, 1994. "The Firm as a Communication Network," The Quarterly Journal of Economics, MIT Press, vol. 109(4), pages 809-39, November.
  10. Dong, Baomin & Ni, Debing & Wang, Yuntong, 2012. "Sharing a polluted river network," MPRA Paper 38839, University Library of Munich, Germany.
  11. Brânzei, R. & Fragnelli, V. & Tijs, S.H., 2000. "Tree-connected Peer Group Situations and Peer Group Games," Discussion Paper 2000-117, Tilburg University, Center for Economic Research.
  12. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Rooted-tree solutions for tree games," European Journal of Operational Research, Elsevier, vol. 203(2), pages 404-408, June.
  13. Ulrich Faigle & Michel Grabisch, 2012. "Values for Markovian coalition processes," PSE - Labex "OSE-Ouvrir la Science Economique" halshs-00749950, HAL.
  14. Chwe, Michael Suk-Young, 2000. "Communication and Coordination in Social Networks," Review of Economic Studies, Wiley Blackwell, vol. 67(1), pages 1-16, January.
  15. V. Crawford & J. Sobel, 2010. "Strategic Information Transmission," Levine's Working Paper Archive 544, David K. Levine.
  16. Haller, Hans, 1994. "Collusion Properties of Values," International Journal of Game Theory, Springer, vol. 23(3), pages 261-81.
  17. Graham, Daniel A & Marshall, Robert C & Richard, Jean-Francois, 1990. "Differential Payments within a Bidder Coalition and the Shapley Value," American Economic Review, American Economic Association, vol. 80(3), pages 493-510, June.
  18. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
  19. Gabrielle Demange, 2004. "On group stability in hierarchies and networks," Post-Print halshs-00581662, HAL.
  20. 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.
  21. Rene van den Brink & Ilya Katsev & Gerard van der Laan, 2009. "Axiomatizations of Two Types of Shapley Values for Games on Union Closed Systems," Tinbergen Institute Discussion Papers 09-064/1, Tinbergen Institute.
  22. repec:hal:journl:halshs-00749950 is not listed on IDEAS
  23. Ni, Debing & Wang, Yuntong, 2007. "Sharing a polluted river," Games and Economic Behavior, Elsevier, vol. 60(1), pages 176-186, July.
  24. Lei Li & Xueliang Li, 2011. "The covering values for acyclic digraph games," International Journal of Game Theory, Springer, vol. 40(4), pages 697-718, November.
  25. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer, vol. 21(3), pages 249-66.
  26. Derks, Jean & Peters, Hans, 1993. "A Shapley Value for Games with Restricted Coalitions," International Journal of Game Theory, Springer, vol. 21(4), pages 351-60.
  27. Gustavo Bergantiños & Silvia Lorenzo-Freire, 2008. "A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems," Economic Theory, Springer, vol. 35(3), pages 523-538, June.
  28. Youngsub Chun, 2006. "No-envy in queueing problems," Economic Theory, Springer, vol. 29(1), pages 151-162, September.
  29. Béal, Sylvain & Lardon, Aymeric & Rémila, Eric & Solal, Philippe, 2011. "The Average Tree Solution for Multi-choice Forest Games," MPRA Paper 28739, University Library of Munich, Germany.
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:unm:umagsb:2013001. 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: (Charles Bollen)

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.