19 resultados para Aggregate Programming Spatial Computing Scafi Alchemist


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a DSGE model in which long run inflation risk matters for social welfare. Aggregate and welfare effects of long run inflation risk are assessed under two monetary regimes: inflation targeting (IT) and price-level targeting (PT). These effects differ because IT implies base-level drift in the price level, while PT makes the price level stationary around a target price path. Under IT, the welfare cost of long run inflation risk is equal to 0.35 percent of aggregate consumption. Under PT, where long run inflation risk is largely eliminated, it is lowered to only 0.01 per cent. There are welfare gains from PT because it raises average consumption for the young and lowers consumption risk substantially for the old. These results are strongly robust to changes in the PT target horizon and fairly robust to imperfect credibility, fiscal policy, and model calibration. While the distributional effects of an unexpected transition to PT are sizeable, they are short-lived and not welfare-reducing.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Time-inconsistency is an essential feature of many policy problems (Kydland and Prescott, 1977). This paper presents and compares three methods for computing Markov-perfect optimal policies in stochastic nonlinear business cycle models. The methods considered include value function iteration, generalized Euler-equations, and parameterized shadow prices. In the context of a business cycle model in which a scal authority chooses government spending and income taxation optimally, while lacking the ability to commit, we show that the solutions obtained using value function iteration and generalized Euler equations are somewhat more accurate than that obtained using parameterized shadow prices. Among these three methods, we show that value function iteration can be applied easily, even to environments that include a risk-sensitive scal authority and/or inequality constraints on government spending. We show that the risk-sensitive scal authority lowers government spending and income-taxation, reducing the disincentive households face to accumulate wealth.