4 resultados para Programming, Linear, utilization
em Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom
Resumo:
In a neoclassical growth model with monopolistic competition in the product market, the presence of cyclical factor utilization enhances the stabilization role of countercyclical taxes. The costs of varying capital utilization take the form of varying rates of depreciation, which in turn have amplifying effect on investment decisions as well as the volatility of most aggregate variables. This creates an additional channel through which taxes affect the economy, a channel that enhances the stabilization role of countercyclical taxes, with particularly strong effects in the labor market. However, in terms of welfare, countercyclical taxes are welfare inferior due to reduced precautionary saving motives.
Resumo:
This paper applies recently developed heterogeneous nonlinear and linear panel unit root tests that account for cross-sectional dependence to 24 OECD and 33 non-OECD countries’ consumption-income ratios over the period 1951–2003. We apply a recently developed methodology that facilitates the use of panel tests to identify which individual cross-sectional units are stationary and which are nonstationary. This extends evidence provided in the recent literature to consider both linear and nonlinear adjustment in panel unit root tests, to address the issue of cross-sectional dependence, and to substantially expand both time-series and cross sectional dimensions of the data analysed. We find that the majority (65%) of the series are nonstationary with slightly fewer OECD countries’ (61%) series exhibiting a unit root than non-OECD countries (68%).
Resumo:
In the line opened by Kalai and Muller (1997), we explore new conditions on prefernce domains which make it possible to avoid Arrow's impossibility result. In our main theorem, we provide a complete characterization of the domains admitting nondictorial Arrovian social welfare functions with ties (i.e. including indifference in the range) by introducing a notion of strict decomposability. In the proof, we use integer programming tools, following an approach first applied to social choice theory by Sethuraman, Teo and Vohra ((2003), (2006)). In order to obtain a representation of Arrovian social welfare functions whose range can include indifference, we generalize Sethuraman et al.'s work and specify integer programs in which variables are allowed to assume values in the set {0, 1/2, 1}: indeed, we show that, there exists a one-to-one correspondence between solutions of an integer program defined on this set and the set of all Arrovian social welfare functions - without restrictions on the range.
Resumo:
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend the analysis of the preference domains containing an inseparable ordered pair, initiated by Kalai and Ritz (1978). We show that these domains admit not only Arrovian social welfare functions \without ties," but also Arrovian social welfare functions \with ties," since they satisfy the strictly decomposability condition introduced by Busetto, Codognato, and Tonin (2012). Moreover, we go further in the comparison between Kalai and Ritz (1978)'s inseparability and Arrow (1963)'s single-peak restrictions, showing that the former condition is more \respectable," in the sense of Muller and Satterthwaite (1985).