Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Graphical Cake Cutting via Maximin Share   We study the recently introduced cake-cutting setting in which the cake is
represented by an undirected graph. This generalizes the canonical interval
cake and allows for modeling the division of road networks. We show that when
the graph is a forest, an allocation satisfying the well-known criterion of
maximin share fairness always exists. Our result holds even when separation
constraints are imposed, in which case no multiplicative approximation of
proportionality can be guaranteed. Furthermore, while maximin share fairness is
not always achievable for general graphs, we prove that ordinal relaxations can
be attained.

9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
25
The categories of this paper are: patt-sol
3
The categories of this paper are: physics
36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-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
35
The categories of this paper are: mtrl-th