Sergey N. Smirnov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sergey N. Smirnov has a total of 110 co-authors. Here are the top co-authors by number of shared publications:
- Elena D. Tabachnikova
B. Verkin ILTPE, NAS of Ukraine, Kharkiv, Ukraine, Ukraine
17 shared publications - Aleksey V. Podolskiy
B. Verkin Institute for Low Temperature Physics and Engineering of National Academy of Sciences of Ukraine
13 shared publications - Vasilij D. Natsik
B.Verkin Institute for Low Temperature Physics and Engineering of the National Academy of Sciences of Ukraine, Ukraine
10 shared publications E. Ya. Rudavskii
B. Verkin Institute for Low Temperature Physics and Engineering , National Academy of Sciences of Ukraine, 47 Nauki Ave., Kharkov, Ukraine
5 shared publicationsV. D. Natsik
Physicotechnical Low-Temperature Institute of B.I. Verkin, NAN Ukrainy , pr. Nauk, 47, Khar'kov 61103, Ukraine and , pl. Svobody, 4, Khar'kov 61077, Ukraine
5 shared publicationsVladimir Z. Bengus
5 shared publications
Latest Publications
- Open Access
- 29 July 2026
- Published by Elsevier in SSRN Electronic Journal
Managing the Transition to an Economy of Freely Chosen Activity under Pervasive General-Purpose Robotic Automation: A Mathematical and Agent-Based Policy Model with a Critical Review of the Literature
We develop a federal-level decision-support framework for managing a long-run transition to an economy in which artificial intelligence and inexpensive general-purpose robots can perform a substantial share of cognitive and physical tasks. The framework does not forecast the technology's arrival: 2041, 2046, and 2051 serve as conditional midpoint scenarios, and one policy package must perform acceptably across all of them. A discrete-time mathematical system is coupled with an agent-based simulation of heterogeneous citizens, six sectors, and a dedicated public transition account. The policy vector combines a tax on automation rents, statutory public participation in robotic capital, a social dividend, lifelong-learning capacity, a public fund, and staged work-time reduction. An operational index measures the capacity for free activity: voluntarily usable time conditional on material security, skills, motivation, and trust. In the illustrative central experiment, the managed package reduces the below-threshold income share from 23.3% to 7.9% and the income Gini from 0.383 to 0.183, at the cost of 6.4% lower output per capita in 2061; a cash-dividend-only policy improves distribution but barely moves free-activity capacity. No numerical level is an estimate for any real economy: the experiment compares mechanisms within one illustrative parameterization. We provide a pre-specified calibration protocol (method of simulated moments, backtesting, ensemble re-optimization), a staged roadmap with monitoring indicators and stopping rules, and a critical review of six literature strands. Code, random seeds, tables, and figures are fully reproducible.
- 29 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessManaging the Transition to an Economy of Freely Chosen Activity under Pervasive General-Purpose Robotic Automation: A Mathematical and Agent-Based Policy Model with a Critical Review of the Literature
We develop a federal-level decision-support framework for managing a long-run transition to an economy in which artificial intelligence and inexpensive general-purpose robots can perform a substantial share of cognitive and physical tasks. The framework does not forecast the technology's arrival: 2041, 2046, and 2051 serve as conditional midpoint scenarios, and one policy package must perform acceptably across all of them. A discrete-time mathematical system is coupled with an agent-based simulation of heterogeneous citizens, six sectors, and a dedicated public transition account. The policy vector combines a tax on automation rents, statutory public participation in robotic capital, a social dividend, lifelong-learning capacity, a public fund, and staged work-time reduction. An operational index measures the capacity for free activity: voluntarily usable time conditional on material security, skills, motivation, and trust. In the illustrative central experiment, the managed package reduces the below-threshold income share from 23.3% to 7.9% and the income Gini from 0.383 to 0.183, at the cost of 6.4% lower output per capita in 2061; a cash-dividend-only policy improves distribution but barely moves free-activity capacity. No numerical level is an estimate for any real economy: the experiment compares mechanisms within one illustrative parameterization. We provide a pre-specified calibration protocol (method of simulated moments, backtesting, ensemble re-optimization), a staged roadmap with monitoring indicators and stopping rules, and a critical review of six literature strands. Code, random seeds, tables, and figures are fully reproducible.
- 30 June 2025
- Published by RosNOU in Vestnik of Russian New University. Series «Complex Systems: Models, Analysis, Management»
- No. 2,p. 73-94
Оптимизация размещения на акватории сил и средств поисково-спасательной службы: модель зимнего периода
В статье рассматриваются вопросы оптимального размещения спасательных подразделений Поисково-спасательной службы Санкт-Петербурга в целях повышения безопасности людей на акватории. Предлагается новый подход к решению задачи оптимального размещения на акватории сил и средств поисково-спасательной службы, имеющий универсальный характер, так как применим к различным акваториям. Проведенный анализ научных трудов и литературы показывает, что научные исследования по указанной теме практически не проводились, не говоря уже о создании математических моделей, позволяющих решить вопросы оптимального размещения на акватории спасательных подразделений. Вопросы взаимного расположения спасательных сил и средств в существующих международных и отечественных научных работах, международных конвенциях и литературе рассматриваются только применительно к процессу поиска, то есть непосредственно в ходе проведении поисковых и спасательных операций на акваториях. Разработанная математическая модель ориентирована на максимизацию вероятности спасения терпящих бедствие людей на водных объектах в зимний период. Конкретная модель строится на примере субъекта Санкт-Петербург. Для построения модели был проведен сбор статистических данных о гибели людей на водных объектах Санкт-Петербурга с 2014 года и проведен статистический анализ показателей гибели людей на водных объектах и возникновения происшествий с людьми. На основании математической модели разработана компьютерная программа, представляющая из себя архив, состоящий из нескольких файлов, написанных на языке Python3 с использованием сторонних библиотек и папок с нужными ресурсами. На основе выполненных расчетов получены рекомендации по совершенствованию инфраструктуры Поисково-спасательной службы Санкт-Петербурга. The article considers the issues of optimal placement of rescue units of St. Petersburg search and rescue service in order to improve the safety of people on the water area. A new approach to solving the problem of optimal placement of forces and means of the search and rescue service on the water area is proposed, which has a universal character as can be applied to different water areas. The analysis of the related scientific works and literature shows that scientific research has not been carried out. No mathematical models were created to solve questions of optimal placement on water area of rescue units. Questions of mutual arrangement of rescue forces and means in existing international and domestic scientific works, international conventions and literature are considered only in relation to the search process, i. e. directly in the course of search and rescue operations on water areas. The developed mathematical model is focused on maximizing the probability of rescue of people in distress on water bodies in winter. The specific model is built on the example of St. Petersburg. To build the model, the statistical data on the deaths of people on water bodies of St. Petersburg since 2014 was collected and statistical analysis of the indicators of deaths on water bodies and occurrence of accidents with people was carried out. Based on the mathematical model, a computer program was developed, which is an archive consisting of several files written in Python3 using third-party libraries and folders with the necessary resources. On the basis of the performed calculations the recommendations for improving the infrastructure of the search and rescue service of St. Petersburg are obtained.
- 30 June 2025
- Published by RosNOU in Vestnik of Russian New University. Series «Complex Systems: Models, Analysis, Management»
- No. 2,p. 73-94
Оптимизация размещения на акватории сил и средств поисково-спасательной службы: модель зимнего периода
В статье рассматриваются вопросы оптимального размещения спасательных подразделений Поисково-спасательной службы Санкт-Петербурга в целях повышения безопасности людей на акватории. Предлагается новый подход к решению задачи оптимального размещения на акватории сил и средств поисково-спасательной службы, имеющий универсальный характер, так как применим к различным акваториям. Проведенный анализ научных трудов и литературы показывает, что научные исследования по указанной теме практически не проводились, не говоря уже о создании математических моделей, позволяющих решить вопросы оптимального размещения на акватории спасательных подразделений. Вопросы взаимного расположения спасательных сил и средств в существующих международных и отечественных научных работах, международных конвенциях и литературе рассматриваются только применительно к процессу поиска, то есть непосредственно в ходе проведении поисковых и спасательных операций на акваториях. Разработанная математическая модель ориентирована на максимизацию вероятности спасения терпящих бедствие людей на водных объектах в зимний период. Конкретная модель строится на примере субъекта Санкт-Петербург. Для построения модели был проведен сбор статистических данных о гибели людей на водных объектах Санкт-Петербурга с 2014 года и проведен статистический анализ показателей гибели людей на водных объектах и возникновения происшествий с людьми. На основании математической модели разработана компьютерная программа, представляющая из себя архив, состоящий из нескольких файлов, написанных на языке Python3 с использованием сторонних библиотек и папок с нужными ресурсами. На основе выполненных расчетов получены рекомендации по совершенствованию инфраструктуры Поисково-спасательной службы Санкт-Петербурга. The article considers the issues of optimal placement of rescue units of St. Petersburg search and rescue service in order to improve the safety of people on the water area. A new approach to solving the problem of optimal placement of forces and means of the search and rescue service on the water area is proposed, which has a universal character as can be applied to different water areas. The analysis of the related scientific works and literature shows that scientific research has not been carried out. No mathematical models were created to solve questions of optimal placement on water area of rescue units. Questions of mutual arrangement of rescue forces and means in existing international and domestic scientific works, international conventions and literature are considered only in relation to the search process, i. e. directly in the course of search and rescue operations on water areas. The developed mathematical model is focused on maximizing the probability of rescue of people in distress on water bodies in winter. The specific model is built on the example of St. Petersburg. To build the model, the statistical data on the deaths of people on water bodies of St. Petersburg since 2014 was collected and statistical analysis of the indicators of deaths on water bodies and occurrence of accidents with people was carried out. Based on the mathematical model, a computer program was developed, which is an archive consisting of several files written in Python3 using third-party libraries and folders with the necessary resources. On the basis of the performed calculations the recommendations for improving the infrastructure of the search and rescue service of St. Petersburg are obtained.
- 1 June 2025
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 31 (2)
Структура почти периодических полугрупп операторов Бебутова - Феллера
УДК 519.217.1 MSC: 47D99, 60J99 DOI: 10.21538/0134-4889-2025-31-2-215-228 Статья опубликована при финансовой поддержке Минобрнауки РФ в рамках реализации программы Московского центра фундаментальной и прикладной математики по соглашению № 075-15-2022-284. В работе вводятся классы однородных марковских процессов со свойством Бебутова — Феллера — слабо почти периодических (почти
- 1 June 2025
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 31 (2)
Структура почти периодических полугрупп операторов Бебутова - Феллера
УДК 519.217.1 MSC: 47D99, 60J99 DOI: 10.21538/0134-4889-2025-31-2-215-228 Статья опубликована при финансовой поддержке Минобрнауки РФ в рамках реализации программы Московского центра фундаментальной и прикладной математики по соглашению № 075-15-2022-284. В работе вводятся классы однородных марковских процессов со свойством Бебутова — Феллера — слабо почти периодических (почти
- 27 September 2024
- Published by Springer Nature in Annals of Finance
- Vol. 20 (4) , 421-458
Approximation and asymptotics in the superhedging problem for binary options
- 27 September 2024
- Published by Springer Nature in Annals of Finance
- Vol. 20 (4) , 421-458
Approximation and asymptotics in the superhedging problem for binary options
- 1 January 2024
- Published by Moscow University Press
Компьютерный практикум: стохастический анализ и моделирование: учебное пособие
Пособие содержит типовые задания компьютерного практикума по курсу «Стохастический анализ и моделирование», требования и общие рекомендации по выполнению, полезные комментарии, образцы решений, пример отчета и теоретическую базу, необходимую для успешного выполнения практикума. Задания позволяют повторить и закрепить полученные в рамках обучения знания, приобрести ценный практический опыт математического, имитационного моделирования и использования метода Монте-Карло. Пособие адресовано студентам 3 и 4 курса кафедры системного анализа факультета ВМК МГУ имени М. В. Ломоносова, обучающимся по направлению подготовки «Прикладная математика и информатика».
- 1 January 2024
- Published by Moscow University Press
Компьютерный практикум: стохастический анализ и моделирование: учебное пособие
Пособие содержит типовые задания компьютерного практикума по курсу «Стохастический анализ и моделирование», требования и общие рекомендации по выполнению, полезные комментарии, образцы решений, пример отчета и теоретическую базу, необходимую для успешного выполнения практикума. Задания позволяют повторить и закрепить полученные в рамках обучения знания, приобрести ценный практический опыт математического, имитационного моделирования и использования метода Монте-Карло. Пособие адресовано студентам 3 и 4 курса кафедры системного анализа факультета ВМК МГУ имени М. В. Ломоносова, обучающимся по направлению подготовки «Прикладная математика и информатика».
- 19 December 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (1) , 215-241
Structural Stability of the Financial Market Model: Continuity of Superhedging Price and Model Approximation
- 19 December 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (1) , 215-241
Structural Stability of the Financial Market Model: Continuity of Superhedging Price and Model Approximation
- 2 June 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (1) , 35-50
A Note on Transition Kernels for the Most Unfavourable Mixed Strategies of the Market
- 2 June 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (1) , 35-50
A Note on Transition Kernels for the Most Unfavourable Mixed Strategies of the Market
- 1 December 2022
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 83 (12) , 2019-2036
Guaranteed Deterministic Approach to Superhedging: Mixed Strategies and Game Equilibrium
For a discrete-time superreplication problem, a guaranteed deterministic formulation is considered: the problem is to ensure the cheapest coverage of the contingent claim on an option under all scenarios that are set using a priori defined compacts depending on the price history. Price increments at each moment of time must lie in the corresponding compact sets. We consider a market with trading constraints and no transaction costs. The statement of the problem is game-theoretic in nature and leads directly to the Bellman–Isaacs equations. In this article, we introduce a mixed extension of the “market” pure strategies. Several results concerning game equilibrium are obtained.
- 1 December 2022
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 83 (12) , 2019-2036
Guaranteed Deterministic Approach to Superhedging: Mixed Strategies and Game Equilibrium
For a discrete-time superreplication problem, a guaranteed deterministic formulation is considered: the problem is to ensure the cheapest coverage of the contingent claim on an option under all scenarios that are set using a priori defined compacts depending on the price history. Price increments at each moment of time must lie in the corresponding compact sets. We consider a market with trading constraints and no transaction costs. The statement of the problem is game-theoretic in nature and leads directly to the Bellman–Isaacs equations. In this article, we introduce a mixed extension of the “market” pure strategies. Several results concerning game equilibrium are obtained.
- Open Access
- 30 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (23) , 4521
Correction: Smirnov, S. A Guaranteed Deterministic Approach to Superhedging—The Case of Convex Payoff Functions on Options. Mathematics 2019, 7, 1246
The author is sorry to report that the statement in Proposition 1 in the paper
- 30 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (23) , 4521
Open AccessCorrection: Smirnov, S. A Guaranteed Deterministic Approach to Superhedging—The Case of Convex Payoff Functions on Options. Mathematics 2019, 7, 1246
The author is sorry to report that the statement in Proposition 1 in the paper
- 1 November 2022
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 83 (11) , 1820-1842
Guaranteed Deterministic Approach to Superhedging: Most Unfavorable Scenarios of Market Behavior and the Moment Problem
We consider a guaranteed deterministic problem setting of discrete-time superreplication: the aim of hedging of a contingent claim is to ensure the coverage of possible payout under the option contract for all admissible scenarios. These scenarios are given by means of a priori given compact sets that depend on the prehistory of prices: the increments of the price at each moment of time must lie in the corresponding compact sets. The absence of transaction costs is assumed. The game-theoretic interpretation implies that the corresponding Bellman–Isaacs equations hold both for pure and mixed strategies. In the present paper, we propose a two-step method for solving the Bellman equation arising in the case of a (game) equilibrium. In particular, the most unfavorable strategies of the “market” can be found in the class of distributions concentrated at most at \(n+1 \) points, where \(n \) is the number of risky assets.- 1 November 2022
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 83 (11) , 1820-1842
Guaranteed Deterministic Approach to Superhedging: Most Unfavorable Scenarios of Market Behavior and the Moment Problem
We consider a guaranteed deterministic problem setting of discrete-time superreplication: the aim of hedging of a contingent claim is to ensure the coverage of possible payout under the option contract for all admissible scenarios. These scenarios are given by means of a priori given compact sets that depend on the prehistory of prices: the increments of the price at each moment of time must lie in the corresponding compact sets. The absence of transaction costs is assumed. The game-theoretic interpretation implies that the corresponding Bellman–Isaacs equations hold both for pure and mixed strategies. In the present paper, we propose a two-step method for solving the Bellman equation arising in the case of a (game) equilibrium. In particular, the most unfavorable strategies of the “market” can be found in the class of distributions concentrated at most at \(n+1 \) points, where \(n \) is the number of risky assets.