  Graph burning is a discrete-time process that models the spread of influence
in a network. Vertices are either burning or unburned, and in each round, a
burning vertex causes all of its neighbours to become burning before a new fire
source is chosen to become burning. We introduce a variation of this process
that incorporates an adversarial game played on a nested, growing sequence of
graphs. Two players, Arsonist and Builder, play in turns: Builder adds a
certain number of new unburned vertices and edges incident to these to create a
larger graph, then every vertex neighbouring a burning vertex becomes burning,
and finally Arsonist `burns' a new fire source. This process repeats forever.
Arsonist is said to win if the limiting fraction of burning vertices tends to
1, while Builder is said to win if this fraction is bounded away from 1.
  The central question of this paper is determining if, given that Builder adds
$f(n)$ vertices at turn $n$, either Arsonist or Builder has a winning strategy.
In the case that $f(n)$ is asymptotically polynomial, we give threshold results
for which player has a winning strategy.
