Below, everything is first-order.
Say that a sentence $\varphi$ is strategically preserved iff player 2 has a winning strategy in the following game:
Players 1 and 2 alternately build a sequence of structures $(\mathfrak{A}_i)_{i\in\omega}$, with each being an induced substructure of the next and each satisfying $\varphi$.
Player $2$ wins iff the union structure $\mathfrak{A}_\infty:=\bigcup_{i\in\omega}\mathfrak{A}_i$ satisfies $\varphi$.
Looking at arbitrary chains of models yields a simpler picture: the sentences preserved under arbitrary chains are exactly those equivalent to a $\forall^*\exists^*$-sentence (see e.g. Theorem 3.2.3 of Chang/Keisler). However, the above notion is looser. For example, the sentence $$\exists x\forall y\exists z[xRz\wedge zRy]$$ is strategically preserved but is not preserved under arbitrary chains.
My main question is simply:
Which sentences (up to semantic equivalence) are strategically preserved?
Since this might not have a simple answer, here's a broader question which may be more attackable:
Is there some $n$ such that every strategically preserved sentence is equivalent to a sentence with $n$ quantifier alternations?