A balanced filter for making optimal decisions

phys.org | 2/13/2019 | Staff
j.moomin (Posted by) Level 3
Click For Photo: https://3c1703fe8d.site.internapcdn.net/newman/gfx/news/hires/2019/3-arudnmathema.jpg

A RUDN mathematician has suggested a method of evaluating the level of nonadditivity in a choice problem, i.e. to calculate how the parameters of the choice are connected to each other, and how it influences the end result. The study provides a method to analyze such systems and find out the most optimal decision by means of calculations. The work was published in Information Sciences.

Decision-making is an integral part of our daily lives. We decide what to have for dinner, which shirt to put on, or which movie to watch. These are relatively easy decisions, but some are much more difficult—for example, buying a car or making an analytical report. In this case, people employ big data sets, use a number of criteria based on their preferences, and finally decide on an optimal solution. The same process takes place on a higher level in private and state organizations when they determine the site for a nuclear power plant or select a new drug to treat a dangerous disease. Even a minor error can cost millions of dollars and thousands of human lives. Therefore, it is important to perfect the decision-making algorithm.

Systems - Criteria - Feature - Nonadditivity - Weight

Systems with multiple criteria have a peculiar feature called nonadditivity. It means that the final weight of all selection criteria is not equal to the sum of weights of each individual criterion added up together. This happens because the criteria are connected to each other. Today's mathematical methods for analyzing such systems are unable to correctly evaluate the obtained results. RUDN mathematicians now suggest a more efficient way of solving this problem.

"Multi-criteria decision analysis...
(Excerpt) Read more at: phys.org
Wake Up To Breaking News!
Sign In or Register to comment.

Welcome to Long Room!

Where The World Finds Its News!