Through a geometric approach, it is shown that a sufficiently large class of incentive (Stackelberg) problems with perfect or partial dynamic information admits optimal incentive schemes that are affine in the available information. As a byproduct of the analysis, explicit expressions for these affine incentive schemes are obtained, and the general results are applied to two different classes of Stackelberg game problems with partial dynamic information.