发表机构
University of Bonn（波恩大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文刻画了可识别偏好类型空间，提出面一致性几何条件，构造最优菜单选择实验，并证明仅两种对称策略可被行为选择。
AI 中文摘要
规划者希望获取关于主体偏好关系的部分信息。偏好被分组为与规划者目的相关的“类型”。规划者能否通过菜单选择数据或实验来识别主体的类型，而无需区分同一类型内的偏好？我们通过刻画可识别类型空间提供了完整答案。该刻画使用了一种新颖的几何条件，称为面一致性，它控制着排列多面体的正方形面和六边形面内部及之间的区分。对于每个可识别的类型空间，我们明确地从其边界构造唯一的不可约识别实验。在添加菜单不能降低成本的成本准则下，该实验在所有识别实验中是最优的。利用Azrieli等人（2021）所示的识别性与带行为的选择之间的等价性，我们研究对称策略，这些策略要求包含仅含可接受产品的未排序短名单，包括每个优于所选产品的产品，并且只要存在可接受产品就非空。只有两种这样的策略可通过行为被选择：请求最喜欢的可接受产品或整个可接受集合。
英文摘要
A planner wants to elicit partial information about a subject's preference relation. Preferences are grouped into ``types" relevant to the planner's purpose. Can the planner identify the subject's type through menu-choice data or experiment, without distinguishing preferences within the same type? We provide a complete answer by characterizing identifiable type spaces. The characterization uses a novel geometric condition, called face consistency, which governs distinctions within and across square and hexagonal faces of the permutohedron. For every identifiable type space, we explicitly construct the unique irreducible identifying experiment from its boundary. This experiment is optimal among all identifying experiments under any cost criterion for which adding menus cannot reduce cost. Using the equivalence between identifiability and elicitation with acts, as shown in Azrieli et al. (2021), we study symmetric policies requesting unranked shortlists that contain only acceptable products, include every product preferred to a selected one, and are nonempty whenever an acceptable product exists. Only two such policies are elicitable with acts: requesting the favorite acceptable product or the entire acceptable set.
