Related papers: About a Ball Removal Process on Bins
Small ball inequalities have been extensively studied in the setting of Gaussian processes and associated Banach or Hilbert spaces. In this paper, we focus on studying small ball probabilities for sums or differences of independent,…
An urn contains black and red balls. Let $Z_n$ be the proportion of black balls at time $n$ and $0\leq L<U\leq 1$ random barriers. At each time $n$, a ball $b_n$ is drawn. If $b_n$ is black and $Z_{n-1}<U$, then $b_n$ is replaced together…
In this article, one investigates in a very general frame mass transference principles from ball to arbitrary open sets when the sequence of balls is distributed according to a finite measure. As an application of the main theorem, a mass…
We analyze the impact of two equal billiard balls in three ideal situations: when the balls freely slide on the plane of the billiard, when they roll without sliding and when one of them freely slides and the other rolls. In all the cases…
The paper is concerned with the classical occupancy scheme with infinitely many boxes, in which $n$ balls are thrown independently into boxes $1,2,...$, with probability $p_j$ of hitting the box $j$, where $p_1\geq p_2\geq...>0$ and…
We study the Min-Weighted Sum Bin Packing problem, a variant of the classical Bin Packing problem in which items have a weight, and each item induces a cost equal to its weight multiplied by the index of the bin in which it is packed. This…
We consider in this paper an urn and ball problem with replacement, where balls are with different colors and are drawn uniformly from a unique urn. The numbers of balls with a given color are i.i.d. random variables with a heavy tailed…
Constructing a suitable schedule for sports competitions is a crucial issue in sports scheduling. The round-robin tournament is a competition adopted in many professional sports. For most round-robin tournaments, it is considered…
Important decisions are likely made by groups of agents. Thus group decision making is very common in practice. Very transparent group aggregating rules are given by weighted voting, where each agent is assigned a weight. Here a proposal is…
We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different…
A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…
We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in $(0,1]$ must be packed in bins of unit size. In each time step, an item either arrives or departs from the…
The efficiency of exact subset sum problem algorithms which compute individual subset sums is defined as $e=min(T/z, 1)$, where $z$ is the number of subset sums computed. $e$ is related to these algorithms' computational complexity. This…
This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…
Team assembly is a problem that demands trade-offs between multiple fairness criteria and computational optimization. We focus on four criteria: (i) fair distribution of workloads within the team, (ii) fair distribution of skills and…
A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or…
We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…
We explore a novel theoretical model for studying the performance of distributed storage management systems where the data-centers have limited capacities (as compared to storage space requested by the users). Prior schemes such as…
We study a fundamental fair allocation problem, where the agent's value is determined by the number of bins either used to pack or cover the items allocated to them. Fairness is evaluated using the maximin share (MMS) criterion. This…
The kinetics of the annihilation process, $A+A\to 0$, with ballistic particle motion is investigated when the distribution of particle velocities is {\it discrete}. This discreteness is the source of many intriguing phenomena. In the mean…