Related papers: Feasibility criteria for high-multiplicity partiti…
We study a two-dimensional generalization of the classical Bin Packing problem, denoted as 2D Demand Bin Packing. In this context, each bin is a horizontal timeline, and rectangular tasks (representing electric appliances or computational…
Sequence partition problems arise in many fields, such as sequential data analysis, information transmission, and parallel computing. In this paper, we study the following partition problem variant: given a sequence of $n$ items…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
As the widely applied method for measuring matching assortativeness in a transferable utility matching game, a matching maximum score estimation is proposed by \cite{fox2010qe}. This article reveals that combining unmatched agents,…
Let $G_1,\dots, G_n\in \mathbb{F}_p[X_1,\dots,X_m]$ be $n$ polynomials in $m$ variables over the finite field $\mathbb{F}_p$ of $p$ elements. For any sufficiently large prime $p$ and non-trivial bounds for the Weyl sums associated to the…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
Our main contribution is a concentration inequality for the symmetric volume difference of a $ C^2 $ convex body with positive Gaussian curvature and a circumscribed random polytope with a restricted number of facets, for any probability…
This article examines differentiability properties of the value function of positioning choice problems, a class of optimisation problems in finite-dimensional Euclidean spaces. We show that positioning choice problems' value function is…
A variety of large-scale machine learning problems can be cast as instances of constrained submodular maximization. Existing approaches for distributed submodular maximization have a critical drawback: The capacity - number of instances…
We build confidence balls for the common density $s$ of a real valued sample $X_1,...,X_n$. We use resampling methods to estimate the projection of $s$ onto finite dimensional linear spaces and a model selection procedure to choose an…
We give a formulation of the single particle occupation probabilities for a system of identical particles obeying fractional exclusion statistics of Haldane. We first derive a set of constraints using an exactly solvable model which…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
Let $w\in L^1\_{loc}(\R^n)$ be apositive weight. Assuming that a doubling condition and an $L^1$ Poincar\'e inequality on balls for the measure $w(x)dx$, as well as a growth condition on $w$, we prove that the compact subsets of $\R^n$…
In problems involving the allocation of a single non-disposable commodity, we study rules defined on a general domain of preferences requiring only that each preference exhibit a unique global maximum. Our focus is on rules that satisfy a…
In this paper, we consider an unconventional overdetermined problem through a property of concavity, which provides some characterizations of balls via Brunn-Minkowski inequalities. In this setting, our rsults can be viewed as the…
Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the other has an opposite objective. Used in a reactive synthesis…
We study the long-term behavior of the two-thinning variant of the classical balls-and-bins model. In this model, an overseer is provided with uniform random allocation of $m$ balls into $n$ bins in an on-line fashion. For each ball, the…
We present a natural family of Hilbert function spaces on the d-dimensional complex unit ball and classify which of them satisfy that subsets of the ball yield isometrically isomorphic subspaces if and only if there is an analytic…
We leverage path differentiability and a recent result on nonsmooth implicit differentiation calculus to give sufficient conditions ensuring that the solution to a monotone inclusion problem will be path differentiable, with formulas for…
In multistage group testing, the tests within the same stage are considered nonadaptive, while those conducted across different stages are adaptive. Specifically, when the pools within the same stage are disjoint, meaning that the entire…