A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms. In particular, we consider whether a given agent receives a given item, a set of items, or a subset of items for five natural classes of sequential allocation mechanisms: balanced, recursively balanced, balanced alternating, strictly alternating and all policies. We identify characterizations of allocations produced balanced, recursively balanced, balanced alternating policies and strictly alternating policies respectively, which extend the well-known characterization by Brams and King [2005] for policies without restrictions. In addition, we examine the computational complexity of possible and necessary allocation problems for these classes.

本文研究了可划分和必需的分配问题，重点关注了一些常用的链式分配机制。对于五个天然的链式分配机制，本文分别给出了平衡、递归平衡、平衡交替、严格交替和所有策略的分配特征，并同时检查了这几个类别中分配问题的计算复杂性。

通过顺序机制实现可行和必要的分配