In this paper we consider the l(1)-state feedback problem with an internal stability constraint. In particular, we establish the connection between controlled-invariant contractive sets and static control laws that achieve a level of l(1) performance as,veil as a desired unforced rate of convergence. We outline two algorithms for computing controlled-invariant contractive sets. The first is a modification of standard recursive techniques used in the literature, whereas the second is based on dynamic games and involves solving an appropriate discrete Isaacs recursion. The latter approach results in a min-max characterization of l(1)-state feedback controllers. We point out that the Isaacs recursion provides a one shut (as opposed to iterative) computation of the optimal l(1) performance.