论文标题

自我实现的选择模型

Self-progressive choice models

论文作者

Yildiz, Kemal

论文摘要

根据给定的\ textit {ragitive ordering},考虑选择行为部分\ textit {可比较}的异源剂的种群。在总体中可以接受的选择函数集可以指定\ textit {peacoy model}。作为指导模型选择过程的标准,我们提出了\ textIt {自我形象},以确保模型解释的每个汇总选择行为在模型本身中具有独特的有序表示。我们在自我实现的选择模型和称为\ textit {lattices}的众所周知的代数结构之间建立了等效性。 这种等效性提供了一个精确的配方,以限制或扩展任何选择模型以进行唯一的有序表示。在此食谱之后,我们确定了一组选择功能,这些功能对于随机效用函数的唯一有序表示至关重要。该扩展模型为\ textIt {选择超载}现象提供了直观的解释。我们提供了确定基本原始订购的必要条件。

Consider a population of heterogenous agents whose choice behaviors are partially \textit{comparable} according to a given \textit{primitive ordering}.The set of choice functions admissible in the population specifies a \textit{choice model}. As a criterion to guide the model selection process, we propose \textit{self-progressiveness}, ensuring that each aggregate choice behavior explained by the model has a unique orderly representation within the model itself. We establish an equivalence between self-progressive choice models and well-known algebraic structures called \textit{lattices}. This equivalence provides for a precise recipe to restrict or extend any choice model for unique orderly representation. Following this recipe, we identify the set of choice functions that are essential for the unique orderly representation of random utility functions. This extended model offers an intuitive explanation for the \textit{choice overload} phenomena. We provide the necessary and sufficient conditions for identifying the underlying primitive ordering.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源