Accumulation games. I: Noisy search
From MaRDI portal
Publication:1367732
DOI10.1023/A:1022639813629zbMath0889.90162OpenAlexW87981002MaRDI QIDQ1367732
William H. Ruckle, Kensaku Kikuta
Publication date: 4 June 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022639813629
Related Items (8)
A Caching Game with Infinitely Divisible Hidden Material ⋮ How to Poison Your Mother-in-Law, and Other Caching Problems ⋮ A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources ⋮ All or Nothing Caching Games with Bounded Queries ⋮ A game related to the number of hides game ⋮ Continuous accumulation games in continuous regions ⋮ The solution to an open problem for a caching game ⋮ Static search games played over graphs and general metric spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Search game in a rectangle
- A remark on the Princess and Monster search game
- On simple MIX game
- Teraoka-type two-person nonzero-sum silent duel
- An Evasion Game on a Finite Tree
- A HIDE AND SEEK GAME WITH TRAVELING COST
- An Evasion Game with Barriers
- A Simple Cover-Up Game
- The Upper Risk of an Inspection Agreement
- A SEARCH GAME WITH TRAVELING COST
- The reporting time problem: Integration of intelligence with verification
- An infiltration game with time dependent payoff
- A remark on a helicopter and submarine game
- A remark on the customs and smuggler game
- Initial point search on weighted trees
- A Multistage Search Game
- A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
- A generalized inspection game
This page was built for publication: Accumulation games. I: Noisy search