Library Header Image
LSE Research Online LSE Library Services

On ruckle's conjecture on accumulation games

Alpern, Steven, Fokkink, Robbert and Kikuta, Ken (2010) On ruckle's conjecture on accumulation games. SIAM Journal on Control and Optimization, 48 (8). pp. 5073-5083. ISSN 0363-0129

Full text not available from this repository.
Identification Number: 10.1137/080741926


In an accumulation game, the Hider secretly distributes his given total wealth h among n locations, while the Searcher picks r locations and confiscates the material placed there. The Hider wins if what is left at the remaining n - r locations is at least 1; otherwise the Searcher wins. Ruckle's conjecture says that an optimal Hider strategy is to put an equal amount h/k at k randomly chosen locations for some k. We extend the work of Kikuta and Ruckle by proving the conjecture for several cases, e.g., r = 2 or n - 2; n ≤ 7; n = 2r - 1; h ≤ 2 + 1/ (n - r)and n ≤ 2r.The last result uses the Erdo″s-Ko-Rado theorem. We establish a con nection between Ruckle's conjecture and the Hoeffding problem of bounding tail probabilities of sums of random variables.

Item Type: Article
Official URL:
Additional Information: © 2010 Society for Industrial and Applied Mathematics
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 30 Mar 2011 11:58
Last Modified: 16 May 2024 01:07

Actions (login required)

View Item View Item