Skip to main content
SpringerLink
Log in

A production problem and computation of the N-core using coverings

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. O. N. Bondareva, “Some applications of linear programming to the theory of cooperative games,” Prob. Kibern., No. 10, 119–139 (1963).

    Google Scholar 

  2. Ch. P. Shimyalis, “A remark on the N-core of a monotone game,” Lit. Mat. Sb.,17, No. 3, 105–109 (1977).

    Google Scholar 

  3. O. R. Men'shikova, “Computation of the generalized N-core,” Zh. Vychisl. Mat. Mat. Fiz.,16, No. 5, 1121–1135 (1976).

    Google Scholar 

Download references

Authors
  1. O. N. Bondareva
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Also sometimes translated as N-nucleolus-see [3]- Translator's Note.

Translated from Kibernetika, No. 2, pp. 101–104, March–Aprill, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bondareva, O.N. A production problem and computation of the N-core using coverings. Cybern Syst Anal 18, 260–265 (1982). https://doi.org/10.1007/BF01074539

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation