A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources

DOI10.1007/S10957-011-9977-1MaRDI QIDQ438788zbMATH OpenOpenAlexWikidataFDO

Authors Christos Pelekis, Steve Alpern, Robbert Fokkink

Publication date 31 July 2012

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10957-011-9977-1

zbMATH Keywords

accumulation gameResource allocation

Mathematics Subject Classification ID

Optimality conditions for problems involving randomness (49K45) Stopping times; optimal stopping problems; gambling theory (60G40) Probabilistic games; gambling (91A60)

Review text

The authors establish a conjecture which arose from work on accumulation games by Kikuta and Ruckle. They consider the problem of how a hider should distribute a continuously divisible good of mass \(y>1\) over a finite number of \(N\) locations, to maximize the probability that a critical amount remains, after an antagonostic searcher remove the material from \(N-k\) of these locations. This critical face defined by other components. They 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.

Recommendations

• On Ruckle's Conjecture on Accumulation Games
• A Caching Game with Infinitely Divisible Hidden Material
• Accumulation games on graphs
• The solution to an open problem for a caching game
• Limits of some combinatorial problems

Cites work

• A game related to the number of hides game
• Accumulation games
• Accumulation games on graphs
• Accumulation games. I: Noisy search
• An ambush game with a fat infiltrator
• Bounds for the Distribution Function of a Sum of Independent, Identically Distributed Random Variables
• Continuous accumulation games in continuous regions
• Hiding and covering in a compact metric space
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Initial point search on weighted trees
• On Ruckle's Conjecture on Accumulation Games
• The Markov Inequality for Sums of Independent Random Variables
• The Number Hides Game
• The theory of search games and rendezvous.

Cited in

(5)

• The solution to an open problem for a caching game
• How to Poison Your Mother-in-Law, and Other Caching Problems
• Limits of some combinatorial problems
• Continuous accumulation games in continuous regions
• Another short proof of optimality for the MIN cache replacement algorithm

This page was built for publication: A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438788)