Taurida Journal of Computer Science Theory and Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Taurida Journal of Computer Science Theory and Mathematics:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Taurida Journal of Computer Science Theory and Mathematics, 2018, Issue 3, Pages 46–70 (Mi tvim51)  

Guaranteed decision for risk-neutrality: the analogue of maximin in one-criterion problem

V. I. Zhukovskiia, S. N. Sachkovb, E. N. Sachkovab

a Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
b Moscow State Regional Institute of Humanities, Orekhovo-Zuevo, Moskovskaya obl.
Abstract: In the middle of the last century, the American mathematician and statistician Professor of the University of Michigan Leonard Savage (1917–1971) and the famous Swiss economist, Professor of the University of Zurich Jurg Niehans (1919–2007) independently proposed an approach to the choice of the solution in the one-criterion problem under uncertainty (OPU), called the principle of minimax regret (according to Niehans–Savage). This principle, along with the Wald's principle of guaranteed result (maximin), plays a crucial role in making a guaranteed decision in OPU. The main role in the principle of minimax regret is the function of regret, which determines the risk according to the Niehans–Savage in the OPU. This risk has been widely used in practical management tasks in recent years. In this article, one of the possible approaches to finding a solution in OPU «from the position» of risk-neutrality — the person making the decision, who simultaneously tries to improve its gain (outcome) and reduce the risk («to kill two birds with one stone with one shot ») is proposed. As an application, the explicit form of such solution is found for a linear-quadratic variant of the OPU in general form.
Keywords: strategy, uncertainty, gain, function of risk, risk according to the Niehans-Savage, the principle of minimax regret.
Funding agency Grant number
Russian Foundation for Basic Research 14-00-90408
Document Type: Article
UDC: 519.853.53:519.816
MSC: 90С47
Language: Russian
Citation: V. I. Zhukovskii, S. N. Sachkov, E. N. Sachkova, “Guaranteed decision for risk-neutrality: the analogue of maximin in one-criterion problem”, Taurida Journal of Computer Science Theory and Mathematics, 2018, no. 3, 46–70
Citation in format AMSBIB
\Bibitem{ZhuSacSac18}
\by V.~I.~Zhukovskii, S.~N.~Sachkov, E.~N.~Sachkova
\paper Guaranteed decision for risk-neutrality: the analogue of maximin in one-criterion problem
\jour Taurida Journal of Computer Science Theory and Mathematics
\yr 2018
\issue 3
\pages 46--70
\mathnet{http://mi.mathnet.ru/tvim51}
Linking options:
  • https://www.mathnet.ru/eng/tvim51
  • https://www.mathnet.ru/eng/tvim/y2018/i3/p46
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Taurida Journal of Computer Science Theory and Mathematics
    Statistics & downloads:
    Abstract page:106
    Full-text PDF :56
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024