Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Possible and Necessary Allocations via Sequential Mechanisms   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.

24
The categories of this paper are: dg-ga
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex
2
The categories of this paper are: math
25
The categories of this paper are: patt-sol