Advanced Search
MyIDEAS: Login

Axiomatizations of Two Types of Shapley Values for Games on Union Closed Systems

Contents:

Author Info

  • Rene van den Brink

    (VU University Amsterdam)

  • Ilya Katsev

    (Russian Academy of Sciences)

  • Gerard van der Laan

    (VU University Amsterdam)

Abstract

This discussion paper led to a publication in 'Economic Theory' , 47(1), 175-88. A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the Shapley value. In the literature various models of games with restricted cooperation can be found. So, instead of allowing all subsets of the player set N to form, it is assumed that the set of feasible coalitions is a subset of the power set of N. In this paper we consider such sets of feasible coalitions that are closed under union, i.e. for any two feasible coalitions also their union is feasible. We consider and axiomatize two solutions or rules for these games that generalize the Shapley value: one is obtained as the conjunctive permission value using a corresponding superior graph, the other is defined as the Shapley value of a modified game similar as the Myerson rule for conference structures.

Download Info

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/09064.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 09-064/1.

as in new window
Length:
Date of creation: 17 Jul 2009
Date of revision:
Handle: RePEc:dgr:uvatin:20090064

Contact details of provider:
Web page: http://www.tinbergen.nl

Related research

Keywords: TU-game; restricted cooperation; union closed system; Shapley value; permission value; superior graph; axiomatization;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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. 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.
  2. Algaba, A. & Bilbao, J.M. & Brink, J.R. van den & Jiménez-Losada, A., 2001. "Axiomatizations of the Shapley Value for Cooperative Games on Antimatroids," Discussion Paper 2001-99, Tilburg University, Center for Economic Research.
  3. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
  4. 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.
  5. RenÊ van den Brink, 1997. "An Axiomatization of the Disjunctive Permission Value for Games with a Permission Structure," International Journal of Game Theory, Springer, vol. 26(1), pages 27-43.
  6. 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.
  7. Youngsub Chun, 2006. "No-envy in queueing problems," Economic Theory, Springer, vol. 29(1), pages 151-162, September.
  8. Algaba, A. & Bilbao, J.M. & Brink, J.R. van den & Jiménez-Losada, A., 2000. "Cooperative Games on Antimatroids," Discussion Paper 2000-124, Tilburg University, Center for Economic Research.
  9. Gilles, R.P. & Owen, G. & Brink, J.R. van den, 1991. "Games with permission structures: The conjunctive approach," Discussion Paper 1991-14, Tilburg University, Center for Economic Research.
  10. 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.
Full references (including those not matched with items on IDEAS)

Citations

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

Cited by:
  1. Brink, R. van den & Herings, P.J.J. & Laan, G. van der & Talman, A.J.J., 2013. "The Average Tree Permission Value for Games with a Permission Tree," Discussion Paper 2013-001, Tilburg University, Center for Economic Research.
  2. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer, vol. 40(2), pages 331-349, May.
  3. Encarnacion Algaba & Jesus Mario Bilbao & Rene van den Brink, 2011. "Harsanyi Power Solutions for Games on Union Stable Systems," Tinbergen Institute Discussion Papers 11-182/1, Tinbergen Institute.
  4. Encarnacion Algaba & Jesus Mario Bilbao & Rene van den Brink, 2011. "Harsanyi Power Solutions for Games on Union Stable Systems," Tinbergen Institute Discussion Papers 11-182/1, Tinbergen Institute.
  5. repec:hal:cesptp:halshs-00749950 is not listed on IDEAS

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:dgr:uvatin:20090064. 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: (Antoine Maartens (+31 626 - 160 892)).

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.