On the Stackelberg Strategy in Nonzero-Sum Games

被引:469
作者
Simaan, M. [1 ,2 ]
Cruz, J. B., Jr. [1 ,2 ]
机构
[1] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[2] Univ Illinois, Dept Elect Engn, Urbana, IL 61801 USA
关键词
D O I
10.1007/BF00935665
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The properties of the Stackelberg solution in static and dynamic nonzero-sum two-player games are investigated, and necessary and sufficient conditions for its existence are derived. Several game problems, such as games where one of the two players does not know the other's performance criterion or games with different speeds in computing the strategies, are best modeled and solved within this solution concept. In the case of dynamic games, linear-quadratic problems are formulated and solved in a Hilbert space setting. As a special case, nonzero-sum linear-quadratic differential games are treated in detail, and the open-loop Stackelberg solution is obtained in terms of Riccati-like matrix differential equations. The results are applied to a simple nonzero-sum pursuit-evasion problem.
引用
收藏
页码:533 / 555
页数:23
相关论文
共 14 条
[1]  
CHEN CI, 1972, IEEE T AUTOMATIC CON, V17
[2]  
Cohen K. J., 1965, PRENTICE HALL INT SE
[3]  
FOLEY MH, 1971, J OPTIMIZATION THEOR, V7
[4]  
Ho Y. C., 1965, IEEE T AUTOMATIC CON, V10
[5]  
Intrilligator M. D., 1971, MATH OPTIMIZATION EC
[6]  
KRIKELIS NJ, 1971, IEEE T AUTOMATIC CON, V16
[7]  
LUCE RD, 1957, GAMES DECISION
[8]  
LUKES DL, 1971, SIAM J CONTROL, V9
[9]  
LUKES DL, 1971, J MATH ANAL APPL, V33
[10]  
NASH J, 1951, ANN MATH, V54