Skip to main content
Log in

Γ-component additive games

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

According to Maschler, Peleg and Shapley (1972) the bargaining set of aconvex game coincides with its core and the kernel consists of the nucleolus only. In this paper we prove the same properties for Γ-component additive games (=graph restricted games in the sense of Owen (1986)) if Γ is a tree. Furthermore, we give a description of the nucleolus of this type of games which makes it easier accessible for computation

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aumann RJ, Maschler M (1964) The bargaining set for cooperative games. In: Advances of game theory. (Dresher M, Shapley LS, Tucker AW Eds.) Princeton University Press Princeton, New Yersey 443–476

    Google Scholar 

  • Bondareva O (1963) Certain applications of the methods of linear programming to the theory of cooperative games. Problemy Kibernitiki 10:119–139 (in Russian)

    Google Scholar 

  • Curiel I, Pederzoli G, Tijs S (1988) Sequencing games. European J of Operational Research 40:344–351

    Google Scholar 

  • Curiel J, Potters J, Rajendra Prasad V, Tijs S, Veltman B (1994) Sequencing and Cooperation. Operations Research (submitted)

  • Curiel J, Potters J, Rajendra Prasad V, Tijs S and Veltman B (1993) Cooperation in one machine scheduling. Zeitschrift fr Operations Research 38:113–129

    Google Scholar 

  • Davis M and Maschler M (1965) The kernel of cooperative game. Naval Res Logist Quarterly 12:233–259

    Google Scholar 

  • Kohlberg E (1971) On the nucleolus of a characteristic function game. SIAM J of Appl Math 20:62–65

    Google Scholar 

  • LeBreton M, Owen G and Weber S (1991) Strongly balanced cooperative games. Intern J of Game Theory 20:419–427

    Google Scholar 

  • Maschler M, Peleg B and Shapley LS (1972) The kernel and bargaining set for convex games. Intern J of Game Theory 1:73–93

    Google Scholar 

  • Muto S, Potters J and Tijs S (1987) Information market games. Intern J of Game Theory 18: 209–226

    Google Scholar 

  • Muto S, Nakayama M, Potters J and Tijs S (1988a) Big boss games. The Economics Studies Quarterly 39:303–321

    Google Scholar 

  • Myerson R (1977) Graphs and cooperation in games. Mathematics of Operations Research 2:225–229

    Google Scholar 

  • Nouweland A van den (1993) Games and graphs in economic situations. PhD Thesis, University of Tilburg, The Netherlands

    Google Scholar 

  • Owen G (1986) Values of graph-restricted games. SIAM Journal of Algebraic and Discrete Methods 7:210–220

    Google Scholar 

  • Potters J, Poos R, Tijs S and Muto S (1988b) Clan games. Games and Economic Behaviour 1:275–293

    Google Scholar 

  • Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17:1163–1170

    Google Scholar 

  • Shapley LS (1967) On Balanced sets and cores. Naval Research Logistics Quarterly 14:453–460

    Google Scholar 

  • Sobolev AI (1975) A characterization of optimality principles in cooperative games by functional equations (Russian) Mathematical Methods in the Social Sciences 6:94–151

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Potters, J., Reijnierse, H. Γ-component additive games. Int J Game Theory 24, 49–56 (1995). https://doi.org/10.1007/BF01258203

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01258203

Key words

Navigation