3 resultados para Event-Driven Programming
em Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom
Resumo:
Part of the local economic impact of a major sporting event comes from the associated temporary tourism expenditures. Typically demand-driven Input-Output (IO) methods are used to quantify the impacts of such expenditures. However, IO modelling has specific weaknesses when measuring temporary tourism impacts; particular problems lie in its treatment of factor supplies and its lack of dynamics. Recent work argues that Computable General Equilibrium (CGE) analysis is more appropriate and this has been widely applied. Neglected in this literature however is an understanding of the role that behavioural characteristics and factor supply assumptions play in determining the economic impact of tourist expenditures, particularly where expenditures are temporary (i.e. of limited duration) and anticipated (i.e. known in advance). This paper uses a CGE model for Scotland in which agents can have myopic- or forward-looking behaviours and shows how these alternative specifications affect the timing and scale of the economic impacts from anticipated and temporary tourism expenditure. The tourism shock analysed is of a scale expected for the Commonwealth Games to be held in Glasgow in 2014. The model shows how “pre-shock” and “legacy” effects – impacts before and after the shock – arise and their quantitative importance. Using the forward-looking model the paper calculates the optimal degree of pre-announcement.
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).