@inbook{35ff3974f8f643b9a73192bd76ac49dc,

title = "Completeness property of information quanta",

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.",

author = "Noghin, {Vladimir D.}",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-67873-3_6",

language = "English",

series = "Studies in Systems, Decision and Control",

publisher = "Springer Nature",

pages = "139--149",

booktitle = "Studies in Systems, Decision and Control",

address = "Germany",

}