Softarisons: theory and practice

Abstract

[EN] This paper introduces the concept of softarison. Softarisons merge soft set theory with the theory of binary relations. Their purpose is the comparison of alternatives in a parameterized environment. We develop the basic theory and interpretations of softarisons. Then, the normative idea of ‘optimal’ alternatives is discussed in this context. We argue that the meaning of ‘optimality’ can be adjusted to fit in with the structure of each problem. A sufficient condition for the existence of an optimal alternative for unrestricted sets of alternatives is proven. This result means a counterpart of Weierstrass extreme value theorem for softarisons; thus, it links soft topology with the act of choice. We also provide a decision-making procedure—the minimax algorithm—when the alternatives are compared through a softarison. A case-study in the context of group interviews illustrates both the application of softarisons as an evaluation tool, and the computation of minimax solutions.