  Inspired by a military context, we study a Stackelberg production game where
a country's government, the leader, wants to maximize the production of
military assets. The leader does so by allocating his resources among a set of
production facilities. His opponent, the follower, observes this allocation and
tries to destroy the associated production as much as possible by allocating
his destructive resources, for example bombs, among these facilities. In this
paper, we identify a follower's optimal strategy. For the leader, we show that
an optimal production strategy can be found in the class of so-called
seried-balanced strategies. We present a linear time algorithm that finds an
optimal strategy in this class.
