Skip to main content
SpringerLink
Log in

A simple procedure to compute the nucleolus of Γ-component additive games

  • Published:
Top Aims and scope Submit manuscript

Summary

This paper considers the Γ-component additive games which take into account the possibilities of communications among agents located in the nodes of a tree graph Γ. Gains from cooperation are derived from agents who are directly connected in the tree. We introduce a new procedure to compute the nucleolus for these games. This procedure is quick and it does not use linear programming techniques. We finally present a numerical example of a sequencing game to illustrate the procedure.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Arin, J. and V. Feltkamp (1994). The nucleolus and kernel of vetorich transferable utility games. Center for Economic Research.Discussion paper:9440. Tilburg University.

  • Borm, P., G. Owen and S. Tijs (1992). On the position value for communication situations. SIAM,Journal on Discrete Mathematics 5, 305–320.

    Article  Google Scholar 

  • Curiel, I. G. Pederzoli and S. Tijs (1989). Sequencing games.European Journal of Operational Research 40, 344–351.

    Article  Google Scholar 

  • Granot, D., M. Maschler, G. Owen and W.R. Zhu (1994). The kernel/nucleolus of a standard tree game.Discussion Paper # 45. Center for Rationality and Interactive Decision Theory. Jerusalem, Israel.

    Google Scholar 

  • Kohlberg, E. (1971). On the nucleolus of a characteristic function game, SIAMJ. Appl. Math. 20, 62–66.

    Article  Google Scholar 

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

    Google Scholar 

  • Nouweland, A. van den. and P. Borm (1991). On the convexity of communication games.International Journal of Game Theory 19, 421–430.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Potters, J. and H. Reijnierse (1992). Γ-component additive games.Working paper, Dept. of Mathematics, University of Nijmegen, Nijmegen, The Netherlands.

    Google Scholar 

  • Schmeidler, D. (1969). The nucleolus of a Characteristic Function Game. SIAMJournal of Applied Mathematics 17, 1163–1170.

    Article  Google Scholar 

  • Solymosi, T. and T.E.S. Raghavan (1994). An algorithm for finding the nucleolus of assignment games.International Journal of Game Theory 23, 119–143.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. de Fundamentos del Análisis Económico, Universidad del País Vasco, Euskal Herriko Unibertsitatea, Pais Vasco, Spain

    F. Grafe & A. Mauleon

  2. Dpto. de Fundamentos del Análisis Económico e Instituto de Economía Pública, Universidad del País Vasco, Euskal Herriko Unibertsitatea, Pais Vasco, Spain

    E. Iñarra

Authors
  1. F. Grafe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Mauleon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Iñarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been supported partially by UPV-EHU research projects: 035.321-HA 130/93 and GV research proyects: 035.321-0046/93.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grafe, F., Mauleon, A. & Iñarra, E. A simple procedure to compute the nucleolus of Γ-component additive games. Top 3, 235–245 (1995). https://doi.org/10.1007/BF02568587

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation