Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts   Given a set of n sticks of various (not necessarily different) lengths, what
is the largest length so that we can cut k equally long pieces of this length
from the given set of sticks? We analyze the structure of this problem and show
that it essentially reduces to a single call of a selection algorithm; we thus
obtain an optimal linear-time algorithm.
  This algorithm also solves the related envy-free stick-division problem,
which Segal-Halevi, Hassidim, and Aumann (AAMAS, 2015) recently used as their
central primitive operation for the first discrete and bounded envy-free cake
cutting protocol with a proportionality guarantee when pieces can be put to
waste.

2
The categories of this paper are: math
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph