arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.13773econ.TH
收藏

离散选择中识别的极限

The Limits of Identification in Discrete Choice

Christopher P. Chambers, Christopher Turansick

AI总结:

本文研究随机效用离散选择模型的识别极限,给出可识别偏好数量的紧界与更弱的充分条件,并证明经典 Latin Square 例子可由随机选择数据识别。

摘要:

本文揭示了已识别随机效用模型中可允许偏好数量的紧界。我们表明,随着离散选择模型中备选方案数量变大,已识别模型中可接纳偏好的比例迅速趋于零。我们提出了一个确保识别的新颖充分条件,该条件严格弱于文献中现有的一些条件。虽然这一充分条件达到了我们的上界,但一个例子表明该条件对于识别并非必要。利用我们的新条件,我们证明社会选择理论中经典的“Latin Square”(拉丁方)例子可从随机选择数据中被识别。

英文摘要:

This paper uncovers tight bounds on the number of preferences permissible in identified random utility models. We show that as the number of alternatives in a discrete choice model becomes large, the fraction of preferences admissible in an identified model rapidly tends to zero. We propose a novel sufficient condition ensuring identification, which is strictly weaker than some of those existing in the literature. While this sufficient condition reaches our upper bound, an example demonstrates that this condition is not necessary for identification. Using our new condition, we show that the classic ``Latin Square" example from social choice theory is identified from stochastic choice data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑