Skip to the main content

Original scientific paper

https://doi.org/10.3326/pse.48.2.2

How can the preferences of policy makers be operationalised in optimum control problems with macroeconometric models? A case study for Slovenian fiscal policies

Dmitri Blueschke orcid id orcid.org/0000-0002-5493-1893 ; Department of Economics, Alpen-Adria-Universität Klagenfurt, Klagenfurt, Austria
Klaus Weyerstrass orcid id orcid.org/0000-0002-5659-8991 ; Macroeconomics and Business Cycles Group, Institute for Advanced Studies, Vienna, Austria
Reinhard Neck ; Department of Economics, Alpen-Adria-Universität Klagenfurt, Klagenfurt, Austria *
Miroslav Verbič orcid id orcid.org/0000-0001-5506-0973 ; School of Economics and Business, University of Ljubljana, Ljubljana, Slovenia

* Corresponding author.


Full text: english pdf 681 Kb

page 151-169

downloads: 86

cite


Abstract

In this paper, we use the results of a survey among Slovenian politicians in order to design an objective function for an optimal control problem with a macroeconometric model for fiscal policy in Slovenia that takes account of policy makers’ preferences. The paper discusses three different scenarios in which the policy preferences revealed in interviews can be included in the objective functions of the control problems. These objective functions are then used to calculate optimal fiscal policies for the Slovenian economy until 2030. For this purpose, we utilise the macroeconometric model SLOPOL10 and the OPTCON2 algorithm. The results indicate qualitatively similar behaviour of the optimised dynamic system and a better performance (lower values of the loss due to deviation from “ideal” paths) from a ranking-based approach than from an ad-hoc assumption of policy makers’ preferences. We sketch how to integrate the approach in a decision-support system for macroeconomic policy design.

Keywords

policy preferences,macroeconomics,fiscal policy,Slovenia,optimum control

Hrčak ID:

317785

URI

https://hrcak.srce.hr/317785

Publication date:

12.6.2024.

Visits: 233 *