Generalized uni–int decision making schemes based on choice value soft sets

This paper aims to improve and further extend Çagman and Enginoglu’s uni–int decision making method. We first define choice value soft sets and k‐satisfaction relations. Using these new notions, we give deeper insights into the principle of uni–int decision making and show its limitations. We then propose several new soft decision making schemes, including the uni–int ^k , $\mathit{uni}''–''{\mathit{int}}_s^t$ and int ^m ‐ int ⁿ decision making methods. We show that classical uni–int decision making is a special case of the $\mathit{uni}''–''{\mathit{int}}_s^t$ decision making method. Furthermore, we present a new decision scheme based on int ^m ‐ int ⁿ decision making, which substantially improves the classical uni–int decision making approach.