Pseudocriteria and pseudocriterial choice (Q1119143): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0165-4896(89)90001-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026252351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New problems in the general choice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: General theory of best variants choice: Some aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global set functions in the theory of alternative selection. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of choice function / rank
 
Normal rank

Latest revision as of 14:01, 19 June 2024

scientific article
Language Label Description Also known as
English
Pseudocriteria and pseudocriterial choice
scientific article

    Statements

    Pseudocriteria and pseudocriterial choice (English)
    0 references
    0 references
    0 references
    1989
    0 references
    The paper is concerned with the external (`input-output') description and investigation of operators implementing the mapping of a finite set of variants onto a segment of the numerical axis. These operators are a generalization of the notion of `function of choice'. For these operators the characteristic properties are defined by specifying domains in the operators' space. A graph and some tournament mechanisms of generating the operators are investigated and natural operations with the operators are introduced. The widely used rules for picking out the best variants - by maximization of a numerical function built beforehand and by superthreshold choice using a function of some kind - are considered as a mapping of domains from the space of the described operators into the subspace of the functions of choice. Domains in the subspace of functions of choice are established onto which these rules map the domains of the operators' space specified by the characteristic properties introduced.
    0 references
    pseudocriteria
    0 references
    rule of choice
    0 references
    graph
    0 references
    tournament mechanisms
    0 references
    operators
    0 references
    functions of choice
    0 references

    Identifiers