DYNAMIC STACKELBERG INCENTIVE GAME PROBLEMS
Xianle Zeng · 1991
In this paper,a convex analytical method is presented to solve dynamic Stackelberg in-centive game problems.The main idea of this method is,by using some results in convex ana-lysis,transforming a complex incentive problem into a simple incentive problem with linearcharacter,and then solving this simple incentive problem.Through this method,the existenceresults and the explicit expressions of optimal incentive strategies are given for a large class ofdynamic Stackelberg incentive problem.