Box-making game

A box game is defined by:

• A family of n pairwise-disjoint sets, ${\displaystyle A_{1},\ldots ,A_{n}}$, of different sizes. The sets are often called "boxes" and the elements are called "balls".
• Two integers, p and q.

The first player, BoxMaker, picks p balls (from the same or different boxes). Then the second player, BoxBreaker, breaks q boxes. And so on.

BoxMaker wins if he has managed to pick all balls in at least one box, before BoxBreaker managed to break this box. BoxBreaker wins if he has managed to break all the boxes.

In general, the optimal strategy for BoxBreaker is to break the boxes with the smallest number of remaining elements. The optimal strategy for BoxMaker is to try to balance the sizes of all boxes. By simulating these strategies, Hamidoune and Las-Vergnas[2] found a sufficient and necessary condition for each player in the (p:q) box game.

For the special case where q=1, each of the following conditions is sufficient:[3]^: 36–39

• If all boxes have the same size k, and ${\displaystyle p\cdot \sum _{i=1}^{n}{1 \over i}<k}$, then BoxBreaker wins the (p:1) box game (using the obvious strategy of breaking the smallest boxes). For comparison, the winning condition for Breaker in a general (p:q) biased game is: ${\displaystyle n<(q+1)^{k/p}}$. With q=1 this becomes ${\displaystyle p\cdot \log _{2}{n}<k}$. The proof uses a potential function. The potential of the game before BoxBreaker's j-th move is defined as: ${\displaystyle {1 \over n-j+1}\sum _{i=j}^{n}c_{i}}$where ${\displaystyle c_{i}}$is the number of elements remaining in box i.
• If the boxes have different sizes ${\displaystyle k_{1},\ldots ,k_{n}}$, and ${\displaystyle \sum _{i=1}^{n}e^{-k_{i}/p}<{1/e}}$, then BoxBreaker wins the (p:1) box game. For comparison, the winning condition for Breaker in a general (p:q) biased game is: ${\displaystyle \sum _{i=1}^{n}(1+q)^{-k_{1}/p}<{1 \over 1+q}}$. With q=1 this becomes ${\displaystyle \sum _{i=1}^{n}2^{-k_{i}/p}<{1 \over 2}}$.