识别随机效用模型的约束条件
Identifying Restrictions on the Random Utility Model
AI总结:
该研究刻画了随机效用模型的可识别性约束,提出一类偏好扰动变换并证明其为行为等价的充要条件,进而得到支撑集约束的可识别性刻画与合理化分布的极值点,还给出了参数化模型的局部可识别性检验方法。
摘要:
我们刻画了能使随机效用模型实现可识别性的事前约束。首先,我们确定了一类简单的扰动变换,这类变换将质量从一组合适的偏好对转移到通过交换特定相容下轮廓集形成的偏好对上。我们证明,两种偏好分布在行为上等价,当且仅当它们可通过有限次此类变换相互得到。利用这一结果,我们专门刻画了随机效用模型支撑集上哪些约束能带来可识别性,以及能合理化给定数据集的分布集合的极值点。最后,当模型平滑依赖于某组参数时,我们证明在温和的拓扑假设下,可识别性可通过一种简单的局部检验来刻画。
英文摘要:
We characterize those ex-ante restrictions on the random utility model which lead to identification. We first identify a simple class of perturbations which transfer mass from a suitable pair of preferences to the pair formed by swapping certain compatible lower contour sets. We show that two distributions over preferences are behaviorally equivalent if and only if they can be obtained from each other by a finite sequence of such transformations. Using this, we obtain specialized characterizations of which restrictions on the support of a random utility model yield identification, as well as of the extreme points of the set of distributions rationalizing a given data set. Finally, when a model depends smoothly on some set of parameters, we show that under mild topological assumptions, identification is characterized by a straightforward, local test.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。