Massively Winning Configurations in the Convex Grabbing Game on the Plane

arXiv2106.11247MaRDI QIDQ6370852FDOQ6370852

Authors: Martin Dvořák, Sara Nicholson 

Publication date: 21 June 2021

Abstract: 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.

This page was built for publication: Massively Winning Configurations in the Convex Grabbing Game on the Plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6370852)