Finding an Optimal Decisions’ Subset by Minimaximax Regret Criterion Regarding Instability of the Decision Function
DOI:
https://doi.org/10.20535/1810-0546.2017.5.105535Keywords:
Decision function, Minimax regret criterion, Optimal decisions’ subset, Metastate, Minimaximax regret criterionAbstract
Background. A generalization of the minimax regret criterion is represented as even the best-assurance minimax regret criterion comes inconsistent under instable evaluations of decision situations.
Objective. The goal is to formulate the minimaximax regret criterion.
Methods. Unlike the classic one, the generalized regret criterion is minimaximax which operates over generalized regrets. These regrets are found from a generalized decision function which is defined on a Cartesian product of a decisions’ set, a set of states, and a set of metastates. Metastate describes instability of the decision function whose values change through a set of metastates. The instability destroys assurance of minimaxed regrets found classically, so regrets are found over a generalized decision function. For this, utility evaluations are subtracted from the utility maximized across a decision set, or the loss/risk minimized across a decision set is subtracted from loss/risk evaluations. Then regrets are minimized under uncertainty across two dimensions of states and metastates, that is they are minimaximaxed.
Results. The suggested minimaximax regret criterion allows finding an optimal decisions’ subset with not only regarding instability of the decision function, but also with reducing the initial decisions’ set more, unlike the ultimate pes-simism criterion without regrets (minimaximax/maximinimin). This especially concerns nonnegative utility matrices with many zeros.
Conclusions. A ratio of a number of optimal decisions by the without-regret maximinimin/minimaximax to a number of optimal decisions by the minimaximax regret criterion decreased by 1 can be interpreted as a gain of applying the represented minimax regret criterion generalization. This gain fundamentally depends on whether sets of decisions, states, and metastates are finite or not. If they all are finite, then the gain depends on values in a three-dimensional regret matrix and its dimensions. It is surprising but the gain may be negative, that is finding regrets may come non-effective.References
R. Yokoyama et al., “A revised method for robust optimal design of energy supply systems based on minimax regret criterion”, Energy Conversion and Management, vol. 84, pp. 196–208, 2014. doi: 10.1016/j.enconman.2014.03.045
Y. Higashikawa et al., “Minimax regret 1-sink location problem in dynamic path networks”, Theor. Comp. Sci., vol. 588, pp. 24–36, 2015. doi: 10.1016/j.tcs.2014.02.010
Y.P. Li et al., “A robust interval-based minimax-regret analysis approach for the identification of optimal water-resources-allocation strategies under uncertainty”, Resources, Conservation and Recycling, vol. 54, iss. 2, pp. 86–96, 2009. doi: 10.1016/j.resconrec.2009.06.011
J. Stoye, “Minimax regret treatment choice with covariates or with limited validity of experiments”, J. Econometrics, vol. 166, iss. 1, pp. 138–156, 2012. doi: 10.1016/j.jeconom.2011.06.012
V.V. Romanuke, “Multiple state problem reduction and decision making criteria hybridization”, Naukovi Visti NTUU KPI, no. 2, pp. 51–59, 2016. doi: 10.20535/1810-0546.2016.2.61603
C.-Y. Wang and S.-M. Chen, “An improved multiattribute decision making method based on new score function of interval-valued intuitionistic fuzzy values and linear programming methodology”, Inform. Sci., vol. 411, pp. 176–184, 2017. doi: 10.1016/j.ins.2017.05.022
R.R. Yager and N. Alajlan, “On the measure based formulation of multi-criteria decision functions”, Inform. Sci., vol. 370-371, pp. 256–269, 2016. doi: 10.1016/j.ins.2016.07.045
S. Zinodiny et al., “Bayes minimax estimation of the mean matrix of matrix-variate normal distribution under balanced loss function”, Stat. Probab. Lett., vol. 125, pp. 110–120, 2017. doi: 10.1016/j.spl.2017.02.003
J.P. Arias-Nicolás et al., “Optimal actions in problems with convex loss functions”, Int. J. Approximate Reasoning, vol. 50, iss. 2, pp. 303–314, 2009. doi: 10.1016/j.ijar.2008.03.014
V.V. Romanuke, “Meta-minimax approach for optimal alternatives subset regarding the change of the risk matrix in ensuring industrial and manufacturing labor safety”, Herald of Khmelnytskyi National University. Tech. Sci., no. 6, pp. 97–99, 2015.
V.V. Romanuke, “Minimaximax approach for finding optimal decisions’ subset regarding changes of the loss function”, Bulletin of V.N. Karazin Kharkiv National University. Ser. Mathematical Modelling. Information Technology. Automated Control Systems, iss. 33, pp. 81–89, 2017.
Downloads
Published
Issue
Section
License
Copyright (c) 2017 Igor Sikorsky Kyiv Polytechnic Institute
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under CC BY 4.0 that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
