.png){kind=icon}
返回
Revealed preference tests for weak separability: An integer programming approach
.png){kind=icon}
OA
AI
DOI：10.1016/j.jeconom.2014.07.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present the revealed preference conditions that characterize the data sets that are consistent with the maximization of a weakly separable utility function. We show that verifying these revealed preference conditions is Np-hard. We also present an integer programming approach, which is particularly attractive in view of empirical analysis. We demonstrate the versatility of this integer programming approach by showing that it allows for testing homothetic separability and weak separability of the indirect utility function. We illustrate the practical usefulness of the approach by an empirical application to Spanish household consumption data. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Weak separability
Revealed preference
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
5.3K
被引数:
3.0W
查看更多机构
.png){kind=icon}
