Hankin, Robin2021-02-102021-02-1020192019Journal of Computational Methods in Sciences and Engineering, vol. 20, no. 1, pp. 65-79, 20201472-79781875-8983https://hdl.handle.net/10292/13980The following problem is considered. Two players are each required to allocate a quota of n counters among k boxes labelled 1, 2, … , k. At times t= 1, 2, 3, … a random box is identified; the probability of choosing box i is pi. If a player has at least one counter in the chosen box, she removes one counter from it; otherwise she takes no action. The winner is the first player to remove all her counters. The game so described may be modified so that each player simultaneously, but independently, identifies a box at random. This paper analyses this deceptively simple game, which has apparently not been studied in the literature. Some analytical and numerical results are then presented, followed by some challenges for further work.The final publication is available at IOS Press through http://dx.doi.org/10.3233/JCM-193658Zero-sum game; Liability allocation game; Allocation game; Colonel Blotto; Coupon collector’s problemJournal ArticleOpenAccess10.3233/jcm-193658