This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

The Component Fairness Solution for Cycle- Free Graph Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Herings,P. Jean-Jacques
Laan,Gerard,van der
Talman,Dolf (METEOR)

Additional information is available for the following registered author(s):

Abstract

In this paper we study cooperative games with limited cooperation possibilities, representedby an undirected cycle-free communication graph. Players in the game can cooperate if andonly if they are connected in the graph, i.e. they can communicate with one another. Weintroduce a new single-valued solution concept, the component fairness solution. Our solution is characterized by component efficiency and component fairness. The interpretationof component fairness is that deleting a link between two players yields for both resultingcomponents the same average change in payoff, where the average is taken over the players in the component. Component fairness replaces the axiom of fairness characterizing the Myerson value, where the players whose link is deleted face the same loss in payoff. Thecomponent fairness solution is always in the core of the restricted game in case the gameis superadditive and can be easily computed as the average of n specific marginal vectors,where n is the number of players. We also show that the component fairness solution canbe generated by a specific distribution of the Harsanyi-dividends.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://edocs.ub.unimaas.nl/loader/file.asp?id=1134
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization in its series Research Memoranda with number 056.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: 2005
Date of revision:
Handle: RePEc:dgr:umamet:2005056

Contact details of provider:
Web page: http://edocs.ub.unimaas.nl/

For technical questions regarding this item, or to correct its listing, contact: (Willy Villevoye).

Related research
Keywords: operations research and management science

Other versions of this item:

This paper has been announced in the following NEP Reports: 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.:
  1. Mamoru Kaneko & Myrna Holtz Wooders, 1982. "Cores of Partitioning Games," Cowles Foundation Discussion Papers 620, Cowles Foundation, Yale University. [Downloadable!]
    Other versions:
  2. Marco Slikker, 2005. "A characterization of the position value," International Journal of Game Theory, Springer, vol. 33(4), pages 505-514, November. [Downloadable!] (restricted)
  3. Demange, Gabrielle, 1994. "Intermediate preferences and stable coalition structures," Journal of Mathematical Economics, Elsevier, vol. 23(1), pages 45-58, January. [Downloadable!] (restricted)
    Other versions:
  4. Gabrielle Demange, 2004. "On Group Stability in Hierarchies and Networks," Journal of Political Economy, University of Chicago Press, vol. 112(4), pages 754-778, August.
  5. Le Breton, M & Owen, G & Weber, S, 1992. "Strongly Balanced Cooperative Games," International Journal of Game Theory, Springer, vol. 20(4), pages 419-27.
    Other versions:
  6. René van den Brink & Gerard van der Laan & Vitaly Pruzhansky, 2004. "Harsanyi Power Solutions for Graph-restricted Games," Tinbergen Institute Discussion Papers 04-095/1, Tinbergen Institute. [Downloadable!]
Full references

Cited by:
(explanations, 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.)

  1. Gómez-Rúa, María & Vidal-Puga, Juan, 2008. "Balanced per capita contributions and levels structure of cooperation," MPRA Paper 8208, University Library of Munich, Germany. [Downloadable!]
  2. Talman, A.J.J. & Yamamoto, Y., 2007. "Games With Limited Communication Structure," Discussion Paper 2007-19, Tilburg University, Center for Economic Research. [Downloadable!]
Statistics
Access and download statistics

Did you know? IDEAS also indexes software components.

This page was last updated on 2008-7-30.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.