完全偏好域上的约束序列规则
Constrained Serial Rule on the Full Preference Domain
摘要：
我们研究的问题，分配对象的代理人在存在任意的线性约束时，代理人被允许是无差别的对象之间。我们的主要贡献是通过一个新的机制称为约束串行规则的（扩展）概率串行机制的泛化。这种机制是计算效率和保持理想的效率和公平性，即受约束的序数效率和嫉妒自由之间的代理相同类型。我们的机制是基于一个线性规划的方法，占所有的约束条件，并提供了一个重新解释的瓶颈集的代理，形成了一个重要组成部分的扩展概率串行机制。
英文摘要：
We study the problem of assigning objects to agents in the presence of arbitrary linear constraints when agents are allowed to be indifferent between objects. Our main contribution is the generalization of the (Extended) Probabilistic Serial mechanism via a new mechanism called the Constrained Serial Rule. This mechanism is computationally efficient and maintains desirable efficiency and fairness properties namely constrained ordinal efficiency and envy-freeness among agents of the same type. Our mechanism is based on a linear programming approach that accounts for all constraints and provides a re-interpretation of the bottleneck set of agents that form a crucial part of the Extended Probabilistic Serial mechanism.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
