Stationarity with Occasionally Binding Constraints
This paper studies a class of multivariate threshold autoregressive models, known as censored and kinked structural vector autoregressions (CKSVAR), which are notably able to accommodate series that are subject to occasionally binding constraints. We develop a set of sufficient conditions for the processes generated by a CKSVAR to be stationary, ergodic, and weakly dependent. Our conditions relate directly to the stability of the deterministic part of the model, and are therefore less conservative than those typically available for general vector threshold autoregressive (VTAR) models. Though our criteria refer to quantities, such as refinements of the joint spectral radius, that cannot feasibly be computed exactly, they can be approximated numerically to a high degree of precision.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Cointegration with Occasionally Binding Constraints
In the literature on nonlinear cointegration, a long-standing open problem relates to how a (nonlinear) vector autoregression, which provides a unified description of the short- and long-run dynamics of a vector of time …
Time SeriesTime Series AnalysisThe unbearable lightness of equilibria in a low interest rate environment
Structural models with no solution are incoherent, and those with multiple solutions are incomplete. We show that models with occasionally binding constraints are not generically coherent. Coherency requires restrictions…
The Local to Unity Dynamic Tobit Model
This paper considers highly persistent time series that are subject to nonlinearities in the form of censoring or an occasionally binding constraint, such as are regularly encountered in macroeconomics. A tractable candi…
modelTime SeriesTime Series AnalysisUnityDeep Learning for Dynamic Programming with Recursive Utility Using First-order Conditions
This paper proposes the certainty-equivalent first-order learning (CEFOL) algorithm, a deep learning algorithm for solving discrete-time dynamic programming problems with recursive utility. Dynamic programming with recur…
Non-stationary Bandits with Knapsacks
In this paper, we study the problem of bandits with knapsacks (BwK) in a non-stationary environment. The BwK problem generalizes the multi-arm bandit (MAB) problem to model the resource consumption associated with playin…