Related papers: The complexity of sharing a pizza
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
In this note, we introduce a distributed twist on the classic coupon collector problem: a set of $m$ collectors wish to each obtain a set of $n$ coupons; for this, they can each sample coupons uniformly at random, but can also meet in…
We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…
The classic cake-cutting problem provides a model for addressing fair and efficient allocation of a divisible, heterogeneous resource (metaphorically, the cake) among agents with distinct preferences. Focusing on a standard formulation of…
Austin's moving knife procedure was originally introduced to find a consensus division of an interval/circular cake between two agents, each of whom believes that they receive exactly half of the cake. We generalise this in two ways: we…
In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…
Do neural networks, trained on well-understood algorithmic tasks, reliably rediscover known algorithms for solving those tasks? Several recent studies, on tasks ranging from group arithmetic to in-context linear regression, have suggested…
Motivated by an application of eliciting users' preferences, we investigate the problem of learning hemimetrics, i.e., pairwise distances among a set of $n$ items that satisfy triangle inequalities and non-negativity constraints. In our…
In this paper, we study the problem of splitting fairly bundles of items. We show that given $n$ bundles with $m$ kinds of items in them, it is possible to distribute the value of each kind of item fairly among $r$ persons by breaking apart…
This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…
Cutting and packing problems arise in a large variety of industrial applications, where there is a need to cut pieces from a large object, or placing them inside a containers, without overlap. When the pieces or the containers have…
This paper describes serial and parallel compositional models of multiple objects with part sharing. Objects are built by part-subpart compositions and expressed in terms of a hierarchical dictionary of object parts. These parts are…
We find out the number of different partitions of an n-kilogram stone into the minimum number of parts so that all integral weights from 1 to n kilograms can be weighed in one weighing using the parts of any of the partitions on a two-pan…
Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are…
Fair division with unequal shares is an intensively studied recourse allocation problem. For $ i\in [n] $, let $ \mu_i $ be an atomless probability measure on the measurable space $(C,\mathcal{S}) $ and let $ t_i $ be positive numbers…
The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H$-free graphs, that is, graphs that do not contain some…
In this paper, we investigate three fundamental problems regarding cut complexes of graphs: their realizability, the uniqueness of graph reconstruction from them, and their algorithmic recognition. We define the parameter $m(d,n)$ as the…
The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and…
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…
Consider a $2\times n$ rectangular grid composed of $1\times 1$ squares. Cutting only along the edges between squares, how many ways are there to divide the board into $k$ pieces? Building off the work of Durham and Richmond, who found the…