Skip to main content
SpringerLink
Log in

Algorithms constructing a representative vector criterion for a binary preference relation

  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

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. F. T. Aliskerov, B. M. Litvakov, and N. V. Zavalishin, "On decomposition of the choice function in a system of simpler functions," Avtomat. Telemekh., No. 3, 107–118 (1979).

    Google Scholar 

  2. V. V. Morozov and V. V. Fedorov, "On construction of a vector criterion from a binary preference relation," Zh. Vychisl. Mat. Mat. Fiz.,20, No. 3, 630–639 (1980).

    Google Scholar 

  3. S. A. Eroshov, "On representation of a binary relation by a vector criterion," in: 1st All-Union Conf. on Statistical and Discrete Analysis of Nonnumerical Information, Expert Judgments, and Discrete Optimization, abstracts of papers [in Russian], Kazakh. Gos. Univ. VNIISI, Moscow—Alma Ata (1981), pp. 316–315.

    Google Scholar 

  4. S. A. Eroshov, "On representation of a binary relation by a vector criterion on infinite sets," Vestn. Mosk. Univ., Ser. 15, Vychisl. Mat. Kibern., No. 1, 60–65 (1983).

    Google Scholar 

  5. W. T. Trotter and K. P. Bogart, "On the complexity of posets," Discr. Math.,16, No. 1, 71–82 (1976).

    Google Scholar 

  6. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).

    Google Scholar 

  7. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, Englewood Cliffs, N.J. (1977).

    Google Scholar 

  8. A. O. Slisenko, "Complexity problems in computation theory," Usp. Mat. Nauk,36, No. 6(222), 21–108.

  9. R. E. Tarjan, "Complexity of combinatorial algorithms," in: Kibern. Sbornik [Russian translations], No. 17, Mir, Moscow (1980), pp. 61–113.

    Google Scholar 

  10. R. P. Dilworth, "A decomposition theorem for partially ordered sets," Ann. Math.,51, 161–166 (1950).

    Google Scholar 

  11. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, N.J. (1962).

    Google Scholar 

  12. S. A. Eroshov, Games with a Vector Payoff Function [in Russian], Abstract of Thesis, Moscow State Univ. (1982).

Download references

Authors
  1. S. A. Eroshov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sistemnoe Programmirovanie i Voprosy Optimizatsii, pp. 118–126, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eroshov, S.A. Algorithms constructing a representative vector criterion for a binary preference relation. Comput Math Model 1, 428–433 (1990). https://doi.org/10.1007/BF01128292

Download citation

  • Issue Date:

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

Keywords

Search

Navigation