English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The containment game is a full information game for two players, initialisedwith a set of occupied vertices in an infinite connected graph $G$. On the$t$-th turn, the first player, called Spreader, extends the occupied set to$g(t)$ adjacent vertices, and then the second player, called Container, removes$q$ unoccupied vertices from the graph. If the spreading process continuesperpetually -- Spreader wins, and otherwise -- Container wins. For $g=\infty$this game reduces to a solitaire game for Container, known as the FirefighterProblem. On $\mathbb{Z}^2$, for $q=1/k$ and $g\equiv 1$ it is equivalent toConway's Angel Problem.  We introduce the game, and writing $q(G,g)$ for the set of $q$ values forwhich Container wins against a given $g(t)$, we study the minimal asymptoticsof $g(t)$ such that $q(G,g)=q(G,\infty)$, i.e. for which defeating Spreader isas hard as winning the Firefighter Problem solitaire. We show, by providingexplicit winning strategies, a sub-linear upper bound $g(t)=O(t^{6/7})$ and alower bound of $g(t)=\Omega(t^{1/2})$.

The Containment Game in the plane: between the Firefighter Problem and Conway's Angel Problem