Sharp for SARP: nonparametric bounds on counterfactual demands
Sharp for SARP: nonparametric bounds on counterfactual demands
复制标题
Sharp for SARP:反事实需求的非参数界限
DOI:
--
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
Frederic Vermeulen
中科院分区:
文献类型:
--
作者:
R. Blundell;M. Browning;L. Cherchye;Ian Crawford;B. Rock;Frederic Vermeulen
Sharp nonparametric bounds are derived for counterfactual demands and Hicksian compensating and equivalent variations. These "i-bounds" refine and extend earlier results of Blundell, Browning, and Crawford (2008). We show that their bounds are sharp under the Weak Axiom of Revealed Preference (WARP) since they do not require transitivity. The new bounds are sharp under the Strong Axiom of Revealed Preference (SARP). By requiring transitivity they can be used to bound welfare measures. The new bounds on welfare measures are shown to be operationalized through algorithms that are easy to implement. (JEL D04, D11)