IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/c4a1cae6-feed-45cd-8ee7-167d0b68253f.html
   My bibliography  Save this paper

The Component Fairness Solution for Cycle-Free Graph Games

Author

Listed:
  • Herings, P.J.J.

    (Tilburg University, Center For Economic Research)

  • van der Laan, G.
  • Talman, A.J.J.

    (Tilburg University, Center For Economic Research)

Abstract

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new single-valued solution concept, the component fairness solution. Our solution is characterized by component efficiency and component fairness. The interpretation of component fairness is that deleting a link between two players yields for both resulting components 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. The component fairness solution is always in the core of the restricted game in case the game is 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 can be generated by a specific distribution of the Harsanyi-dividends.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2005. "The Component Fairness Solution for Cycle-Free Graph Games," Discussion Paper 2005-127, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:c4a1cae6-feed-45cd-8ee7-167d0b68253f
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/776741/127.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Le Breton, M & Owen, G & Weber, S, 1992. "Strongly Balanced Cooperative Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(4), pages 419-427.
    2. John F. Veiga & Michael Lubatkin & Roland Calori & Philippe Véry, 2000. "Measuring organizational culture: A two nation post-hoc analysis of a cultural compatibility index," Post-Print hal-02311644, HAL.
    3. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    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. Quah, Penelope & Young, Stephen, 2005. "Post-acquisition Management:: A Phases Approach for Cross-border M&As," European Management Journal, Elsevier, vol. 23(1), pages 65-75, February.
    6. Ingemar Dierickx & Karel Cool, 1989. "Asset Stock Accumulation and Sustainability of Competitive Advantage," Management Science, INFORMS, vol. 35(12), pages 1504-1511, December.
    7. Desmond Graves, 1981. "Individual Reactions To A Merger Of Two Small Firms Of Brokers In The Re‐Insurance Industry: A Total Population Survey," Journal of Management Studies, Wiley Blackwell, vol. 18(1), pages 89-113, January.
    8. René Brink & Gerard Laan & Vitaly Pruzhansky, 2011. "Harsanyi power solutions for graph-restricted games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 87-110, February.
    9. Julian Birkinshaw & Henrik Bresman & Lars Håkanson, 2000. "Managing the Post‐acquisition Integration Process: How the Human Iintegration and Task Integration Processes Interact to Foster Value Creation," Journal of Management Studies, Wiley Blackwell, vol. 37(3), pages 395-425, May.
    10. Demange, Gabrielle, 1994. "Intermediate preferences and stable coalition structures," Journal of Mathematical Economics, Elsevier, vol. 23(1), pages 45-58, January.
    11. Ashkanasy, Neal M. & Holmes, Scott, 1995. "Perceptions of organizational ideology following merger: A longitudinal study of merging accounting firms," Accounting, Organizations and Society, Elsevier, vol. 20(1), pages 19-34, January.
    12. Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Other publications TiSEM 5a8473e4-1df7-42df-ad53-f, Tilburg University, School of Economics and Management.
    13. repec:bla:jomstd:v:37:y:2000:i::p:395-425 is not listed on IDEAS
    14. Schuler, Randall & Jackson, Susan, 2001. "HR issues and activities in mergers and acquisitions," European Management Journal, Elsevier, vol. 19(3), pages 239-253, June.
    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


    Cited by:

    1. María Gómez-Rúa & Juan Vidal-Puga, 2011. "Balanced per capita contributions and level structure of cooperation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 167-176, July.
    2. Talman, A.J.J. & Yamamoto, Y., 2007. "Games With Limited Communication Structure," Other publications TiSEM e5f3ebff-9aea-4023-9525-b, Tilburg University, School of Economics and Management.

    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. Heijltjes, M.G. & Velde ter, H., 2005. "Leadership in a post-merger context: the importance of people skills over politics," Research Memorandum 058, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. 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.
    3. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    4. Talman, A.J.J. & Yamamoto, Y., 2007. "Games With Limited Communication Structure," Other publications TiSEM e5f3ebff-9aea-4023-9525-b, Tilburg University, School of Economics and Management.
    5. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    6. Heinz, S. & Krumke, S.O. & Megow, N. & Rambau, J. & Tuscherer, A. & Vredeveld, T., 2005. "The online target date assignment problem," Research Memorandum 056, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    7. 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.
    8. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    9. Debasis Mishra & A. Talman, 2010. "A characterization of the average tree solution for tree games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 105-111, March.
    10. 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.
    11. 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.
    12. Anna Khmelnitskaya & Gerard van der Laan & Dolf Talman, 2016. "Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games," Tinbergen Institute Discussion Papers 16-070/II, Tinbergen Institute.
    13. 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.
    14. Demange, Gabrielle, 2024. "Stable outcomes in simple cooperative games," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    15. Mishra, D. & Talman, A.J.J., 2009. "A Characterization of the Average Tree Solution for Cycle-Free Graph Games," Discussion Paper 2009-17, Tilburg University, Center for Economic Research.
    16. Özer Selçuk & Takamasa Suzuki, 2023. "Comparable axiomatizations of the average tree solution and the Myerson value," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 333-362, June.
    17. van den Brink, René, 2012. "Efficiency and collusion neutrality in cooperative games and networks," Games and Economic Behavior, Elsevier, vol. 76(1), pages 344-348.
    18. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    19. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Discussion Paper 2011-100, Tilburg University, Center for Economic Research.
    20. 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;Game Theory Society, vol. 40(2), pages 331-349, May.

    More about this item

    Keywords

    TU-games; communication structure; Myerson value; fairness; marginal vector;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:tiu:tiucen:c4a1cae6-feed-45cd-8ee7-167d0b68253f. See general information about how to correct material in RePEc.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.