Skip to main content
Log in

Coincidence of k-and n-kernels for centered games

  • Published:
Lithuanian Mathematical Journal Aims and scope Submit manuscript

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.

Literature Cited

  1. M. Davis and M. Maschler, “The kernel of a cooperative game,” Nav. Res. Log. Q.,12, 223–259 (1965).

    Google Scholar 

  2. D. Schmeidler, “The nucleolus if a characteristic function game,” SIAM J. Appl. Math.,17, No. 6, 1163–1170 (1969).

    Google Scholar 

  3. M. Maschler and B. Peleg, “A characterization, existence proof and dimension bounds for the kernel of a game,” Pac. J. Math.,18, No. 2, 289–328 (1966).

    Google Scholar 

  4. C. Simelis, “Algorithm for calculating the n-kernel of a centered game,” in: Contemporary Directions in Game Theory [in Russian], Mokslas, Vilnius (1976), pp. 127–135.

    Google Scholar 

  5. E. Kohlberg, “On the nucleolus of a characteristic function game,” SIAM J. Appl. Math.,20, No. 1, 62–66 (1971).

    Google Scholar 

Download references

Authors

Additional information

Institute of Mathematics and Cybernetics, Academy of Sciences of the Lithuanian SSR. Translated from Litovskii Matematicheskii Sbornik (Lietuvos Matematikos Rinkinys), Vol. 22, No. 1, pp. 203–207, January–March, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Šimelis, Č. Coincidence of k-and n-kernels for centered games. Lith Math J 22, 101–104 (1982). https://doi.org/10.1007/BF00967933

Download citation

  • Received:

  • Issue Date:

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

Navigation