|
A model of economic policy making with transaction costs and breach-of-contract risk insurance
S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk Russia
Abstract:
This article continues the authors' research into cooperation between public and private investors in a resource region. In contrast with previous works, an attempt is made here to take into account the institutional features of the process of forming the investment climate. For this, transaction costs are introduced into the model and a mechanism for breach-of-contract risk insurance is formed. In the Russian mineral resource complex, costs and risks of this kind can be very significant. This work aims to analyze the partnership mechanisms, taking into account these circumstances and using the game-theoretical Stackelberg model. Such mechanisms determine the economic policy of the government and play an important role in stimulating private investment. The model is formulated as a bilevel mathematical programming problem. Effective solution algorithms based on metaheuristics are developed. This makes possible the practical studying the properties of Stackelberg equilibrium on the real data. The equilibrium determine the design of the mechanism of economic policy making, fully meeting the interests of society. Illustr. 8, bibliogr. 21.
Keywords:
stochastic local search, Stackelberg game, bilevel mathematical programming problems, strategic planning, investment climate, transaction costs, breach-of-contract risk insurance.
Received: 05.05.2022 Revised: 05.05.2022 Accepted: 06.05.2022
Citation:
S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov, “A model of economic policy making with transaction costs and breach-of-contract risk insurance”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 45–63
Linking options:
https://www.mathnet.ru/eng/da1302 https://www.mathnet.ru/eng/da/v29/i3/p45
|
Statistics & downloads: |
Abstract page: | 89 | Full-text PDF : | 14 | References: | 23 | First page: | 3 |
|