发表机构
Faculty of Business and Economics, University of Lausanne; Department of Quantitative Economics, Maastricht University（洛桑大学工商管理学院; 马斯特里赫特大学数量经济学系）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文研究混合所有权物品分配问题中的排除核，提出序列顶层交易循环算法，证明其刻画排除核的最大域、稳定性检验、稳定集性质及动态路径存在性。
AI 中文摘要
我们研究了Balbuzanov和Kotowski（2019）针对具有复杂禀赋的物品分配问题提出的排除核。我们聚焦于混合所有权物品分配问题，其中每个物品要么由单个代理个体所有，要么由所有代理共同所有。给定代理的优先顺序、禀赋结构、初始分配以及代理的偏好，我们构建了序列顶层交易循环（STTC）图并定义了相应的STTC算法。该算法是我们分析排除核稳定分配的核心工具。首先，我们证明，在由禀赋结构限制定义的域中，混合所有权域是STTC算法刻画排除核的最大域。其次，我们提供了一个简单的排除核稳定性检验：一个分配是排除核稳定的，当且仅当它是从该分配初始化的STTC算法的固定点，且与优先顺序无关。第三，我们证明排除核是关于排除支配的冯·诺依曼-摩根斯坦（1944）稳定集。最后，我们研究了一个动态排除阻塞过程，并证明从任何分配出发，都存在一条自包含的排除阻塞路径通向排除核。
英文摘要
We study Balbuzanov and Kotowski's (2019) exclusion core for object allocation problems with complex endowments. We focus on mixed-ownership object allocation problems in which each object is either individually owned by one agent or publicly owned by all agents. Given a priority order over agents, an endowment structure, an initial allocation, and agents' preferences, we construct serial top trading cycles (STTC) graphs and define the associated STTC algorithm. The algorithm is the central tool for our analysis of exclusion-core-stable allocations. First, we show that, among domains defined by restrictions on endowment structures, the mixed-ownership domain is the largest on which the STTC algorithms characterize the exclusion core. Second, we provide a simple test for exclusion core stability: an allocation is exclusion core stable if and only if it is a fixed point of the STTC algorithm initialized at that allocation, independently of the priority order. Third, we show that the exclusion core is a von Neumann--Morgenstern (1944) stable set with respect to exclusion-domination. Finally, we study a dynamic exclusion-blocking process and show that, from any allocation, there exists a self-contained exclusion-blocking path to the exclusion core.
Comments55 pages, 4 figures
