Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Massively Winning Configurations in the Convex Grabbing Game on the
  Plane   The convex grabbing game is a game where two players, Alice and Bob,
alternate taking extremal points from the convex hull of a point set on the
plane. Rational weights are given to the points. The goal of each player is to
maximize the total weight over all points that they obtain. We restrict the
setting to the case of binary weights. We show a construction of an arbitrarily
large odd-sized point set that allows Bob to obtain almost 3/4 of the total
weight. This construction answers a question asked by Matsumoto, Nakamigawa,
and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an
arbitrarily large even-sized point set where Bob can obtain the entirety of the
total weight. Finally, we discuss conjectures about optimum moves in the convex
grabbing game for both players in general.

14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con
25
The categories of this paper are: patt-sol
1
The categories of this paper are: cs
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
13
The categories of this paper are: quant-ph
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int