arXiv (OAI Expanded)
open access
Optimal Hiding with Partial Information of the Seeker's Route
We consider a hide-and-seek game between a Hider and a Seeker over a finite set of locations. The Hider chooses one location to conceal a stationary treasure, while the Seeker visits the locations sequentially along a route. As the search progresses, the Hider observes a prefix of the Seeker's route
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
- Watermarked Game Solving via Perturbed Regret Minimization#612414
- Watermarked Game Solving via Perturbed Regret Minimization#610937
- Minimization Prophet Inequality with Bounded Costs#974040
Record · ID 1122441
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive