  Delay games are two-player games of infinite duration in which one player may
delay her moves to obtain a lookahead on her opponent's moves. We consider
delay games with winning conditions expressed in weak monadic second order
logic with the unbounding quantifier, which is able to express (un)boundedness
properties. We show that it is decidable whether the delaying player has a
winning strategy using bounded lookahead and give a doubly-exponential upper
bound on the necessary lookahead. In contrast, we show that bounded lookahead
is not always sufficient to win such a game.
