A Caching Game with Infinitely Divisible Hidden Material
DOI10.1137/140997075zbMath1331.91042OpenAlexW1632065743MaRDI QIDQ2949985
Publication date: 5 October 2015
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/64478/1/__lse.ac.uk_storage_LIBRARY_Secondary_libfile_shared_repository_Content_Lidbetter%2C%20T_Caching%20game_Lidbetter_Caching%20game_2015.pdf
Search theory (90B40) 2-person games (91A05) Applications of game theory (91A80) Discrete location and assignment (90B80) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Unnamed Item
- Weighted covering numbers of convex sets
- Covering a square of side \(n+\varepsilon\) with unit squares
- On weighted covering numbers and the Levi-Hadwiger conjecture
- On a covering problem for equilateral triangles
- On packing squares with equal squares
- Accumulation games. I: Noisy search
- The theory of search games and rendezvous.
- Search games and other applications of game theory
- Hiding and covering in a compact metric space
- Some Cinderella Ruckle Type Games
- Disperse or Unite? A Mathematical Model of Coordinated Attack
- On Ruckle's Conjecture on Accumulation Games
- A Mixed-Strategy Minimax Theorem without Compactness
- Continuous accumulation games on discrete locations
- Accumulation games on graphs
- Effects of centralization on expected profits in a multi-location newsboy problem
- Goal-Driven Optimization
- Hide and Seek, Data Storage, and Entropy
- Optimal Inventory Policy
- Continuous accumulation games in continuous regions
This page was built for publication: A Caching Game with Infinitely Divisible Hidden Material
