z-logo
open-access-imgOpen Access
St. Petersburg paradox: adoption of decisions on the basis of data mining and development of software in the sphere of business analytics
Author(s) -
Mikhail Samuilovich Gasparian,
Irina Anatolievna Kiselеvа,
В. А. Титов,
Natalia Alekseevna Sadovnikovа
Publication year - 2021
Publication title -
nexo
Language(s) - English
Resource type - Journals
eISSN - 1995-9516
pISSN - 1818-6742
DOI - 10.5377/nexo.v34i04.12676
Subject(s) - mathematical economics , computer science , basis (linear algebra) , expected utility hypothesis , software , management science , operations research , economics , mathematics , geometry , programming language
This article is devoted to analysis of models of St. Petersburg paradox, as well as development of software in the sphere of business analysis. This work is based on mathematical models using theories of probability and games as well as expert survey method. It is demonstrated that the St. Petersburg paradox is a mathematical problem of probability theory with artificial conditions. The influence of this problem on economical theory is exemplified by such provisions as the principle of diminishing marginal utility, the use of expected utility as criterion of decision adoption in uncertain environment, as well as foundations of microeconomics of insurance and risk management, theory of games and some approaches to financial simulation. Adoption of decisions on the basis of the St. Petersburg paradox is analyzed. Review of main decisions of the St. Petersburg paradox and their influence for economic theory has confirmed that the St. Petersburg paradox as a mathematical problem can be used as mathematical model upon implementation of financial simulation. Comparative analysis of available BI solutions has confirmed that most of them propose all major functions, and significant differences can be revealed in penetration of expanded functions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here