A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources (Q438788): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Steven Alpern / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Robbert J. Fokkink / rank | |||
Normal rank |
Revision as of 17:21, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources |
scientific article |
Statements
A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources (English)
0 references
31 July 2012
0 references
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.
0 references
Resource allocation
0 references
accumulation game
0 references