  Restaking protocols have aggregated billions of dollars of security by
utilizing token incentives and payments. A natural question to ask is: How much
security do restaked services \emph{really} need to purchase? To answer this
question, we expand a model of Durvasula and Roughgarden [DR24] that includes
incentives and an expanded threat model consisting of strategic attackers and
users. Our model shows that an adversary with a strictly submodular profit
combined with strategic node operators who respond to incentives can avoid the
large-scale cascading failures of~[DR24]. We utilize our model to construct an
approximation algorithm for choosing token-based incentives that achieve a
given security level against adversaries who are bounded in the number of
services they can simultaneously attack. Our results suggest that incentivized
restaking protocols can be secure with proper incentive management.
