Alpern, Steven, Fokkink, Robbert and Pelekis, Christos (2012) A proof of the Kikuta–Ruckle Conjecture on cyclic caching of resources. Journal of optimization theory and applications, 153 (3). pp. 650-661. ISSN 0022-3239
Suppose that a hider possesses a continuously divisible resource that he may distribute around a circle. The resources on a random arc in the circle are lost. The hider has a priori information on the length of the arc and he wants to maximize the probability that the retrieved portion exceeds a critical quantity, which is enough to survive on. We show that there exists an optimal resource distribution, which uses a finite number of point caches of equal size, establishing a conjecture of Kikuta and Ruckle. Our result is related to a conjecture of Samuels' on-tail probabilities.
|Additional Information:||© 2012 The authors|
|Uncontrolled Keywords:||ISI, Farey numbers, resource allocation, tail probability|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Date Deposited:||06 Jan 2012 10:25|
Actions (login required)
|Record administration - authorised staff only|