A Liability Allocation Game
Date
Authors
Supervisor
Item type
Journal Article
Degree name
Journal Title
Journal ISSN
Volume Title
Publisher
IOS Press
Abstract
The 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.Description
Source
Journal of Computational Methods in Sciences and Engineering, vol. 20, no. 1, pp. 65-79, 2020
Rights statement
The final publication is available at IOS Press through http://dx.doi.org/10.3233/JCM-193658