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

DOI10.1007/s10957-011-9977-1zbMath1248.91026OpenAlexW1563808011WikidataQ122910417 ScholiaQ122910417MaRDI QIDQ438788

Christos Pelekis, Robbert J. Fokkink, Steven Alpern

Publication date: 31 July 2012

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

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

zbMATH Keywords

Resource allocationaccumulation game

Mathematics Subject Classification ID

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

Related Items (2)

How to Poison Your Mother-in-Law, and Other Caching Problems ⋮ The solution to an open problem for a caching game

Cites Work

• Unnamed Item
• Unnamed Item
• Accumulation games. I: Noisy search
• The theory of search games and rendezvous.
• Hiding and covering in a compact metric space
• A game related to the number of hides game
• On Ruckle's Conjecture on Accumulation Games
• Bounds for the Distribution Function of a Sum of Independent, Identically Distributed Random Variables
• The Number Hides Game
• Initial point search on weighted trees
• Accumulation games on graphs
• Technical Note—An Ambush Game with a Fat Infiltrator
• The Markov Inequality for Sums of Independent Random Variables
• Continuous accumulation games in continuous regions

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