Completeness property of information quanta

Research outputpeer-review

Abstract

In this chapter, we justify theoretically the original axiomatic approach to Pareto set reduction based on a finite collection of information quanta. Here the exposition seems most difficult in mathematical terms, but the readers with an insufficient background may skip it without losing the comprehension of further material. The whole essence of the results derived below can be expressed as follows. Information in the form of quanta is complete: for any multicriteria choice problem from a definite (rather wide) class, it is possible to find the unknown set of nondominated vectors (nondominated alternatives) with an arbitrary accuracy only based on such information. Moreover, if the number of feasible vectors is finite, then the set of nondominated vectors can be constructed precisely.

Original languageEnglish
Title of host publicationStudies in Systems, Decision and Control
PublisherSpringer Nature
Pages139-149
Number of pages11
DOIs
Publication statusPublished - 1 Jan 2018

Publication series

NameStudies in Systems, Decision and Control
Volume126
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

Scopus subject areas

  • Computer Science (miscellaneous)
  • Decision Sciences (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)
  • Automotive Engineering
  • Control and Systems Engineering
  • Control and Optimization
  • Social Sciences (miscellaneous)

Fingerprint Dive into the research topics of 'Completeness property of information quanta'. Together they form a unique fingerprint.

Cite this