Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents   We consider the well-studied cake cutting problem in which the goal is to
identify a fair allocation based on a minimal number of queries from the
agents. The problem has attracted considerable attention within various
branches of computer science, mathematics, and economics. Although, the elegant
Selfridge-Conway envy-free protocol for three agents has been known since 1960,
it has been a major open problem for the last fifty years to obtain a bounded
envy-free protocol for more than three agents. We propose a discrete and
bounded envy-free protocol for four agents.

9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
2
The categories of this paper are: math
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
32
The categories of this paper are: atom-ph
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
12
The categories of this paper are: nucl-th
16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ