Caching and Accumulation Games

Áron Jánosik et al.

International Game Theory Review2025https://doi.org/10.1142/s0219198925500057article
AJG 1ABDC B
Weight
0.50

What the paper says

In this paper, we investigate a discrete search game called the Multiple Caching Game where the searcher’s aim is to find all of a set of [Formula: see text] treasures hidden in [Formula: see text] locations. Allowed queries are sets of locations of size [Formula: see text], and the searcher wins if in all [Formula: see text] queries, at least one treasure is hidden in one of the [Formula: see text] picked locations. Pálvölgyi showed that the value of the game is at most [Formula: see text], with equality for large enough [Formula: see text]. We conjecture the exact cases of equality. We also investigate variants of the game and show an example where their values are different, answering a question of Pálvölgyi. This game is closely related to a continuous variant, Alpern’s Caching Game, based on which we define other continous variants of the multiple caching game and examine their values.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1142/s0219198925500057

Or copy a formatted citation

@article{áron2025,
  title        = {{Caching and Accumulation Games}},
  author       = {Áron Jánosik et al.},
  journal      = {International Game Theory Review},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1142/s0219198925500057},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Caching and Accumulation Games

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.