Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Which Unbounded Protocol for Envy Free Cake Cutting is Better?   A division of a cake by n people is envy free if everyone thinks they got the
biggest pieces. Note that peoples tastes can differ. There is a discrete
protocol for envy free division for n=3 which takes at most 5 cuts. For n=4 and
beyond there is a protocol but the number of cuts it takes is unbounded. In
particular the number of cuts depends on peoples tastes. Given any number N
peoples tastes can be set so that the algorithm takes over N cuts. There are
three such algorithms known. Which is better?
  We have devised a way to measure the number of cuts even though it is
unbounded. We use ordinals; therefore, a statement like "this protocol takes at
most 2omega steps" makes sense. We analyse all three discrete algorithms for
envy free cake cutting with this measure.

24
The categories of this paper are: dg-ga
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
3
The categories of this paper are: physics
36
The categories of this paper are: cmp-lg
20
The categories of this paper are: acc-phys
23
The categories of this paper are: solv-int
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph