Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Query Complexity of Cake Cutting   We study the query complexity of cake cutting and give lower and upper bounds
for computing approximately envy-free, perfect, and equitable allocations with
the minimum number of cuts. The lower bounds are tight for computing connected
envy-free allocations among n=3 players and for computing perfect and equitable
allocations with minimum number of cuts between n=2 players.
  We also formalize moving knife procedures and show that a large subclass of
this family, which captures all the known moving knife procedures, can be
simulated efficiently with arbitrarily small error in the Robertson-Webb query
model.

2
The categories of this paper are: math
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int