可结盟对策上的最优结盟方案  

Optimal Coalition Plan on an Alignment Game

作　　者：姜殿玉[1] 

机构地区：[1]淮海工学院数理科学系,江苏连云港222005

出　　处：《淮海工学院学报（自然科学版）》2007年第1期1-3,共3页Journal of Huaihai Institute of Technology:Natural Sciences Edition

基　　金：国家自然科学基金资助项目(78970025)

摘　　要：结盟问题是三人以上对策中的一个重要内容.在带有计策的对策结构中,某个局中人与哪些局中人结盟、结盟的先后顺序、盟内外成员对于所用联合策略的公开与保密等等都是谋略问题,例如三十六计中的远交近攻.用形式化的方法研究和描述了可结盟对策上的最优结盟方案,并且其结果和结论由算法形式给出.The forming of an alliance is an important part of games with more than three players. In a game with tricks, the following problems are closely related to the choice of strategies： Whose alliance should a player be？ What is the order of being allied？ Should a player make public or keep secret the members＇ alliance strategies？ For instance, The Thirty-six Strategies stipulates that a state should keep diplomatic relations with the distant states and attack the neighboring ones. This paper adopts the formalized method to research and describe the optimal coalition plan on an alignment game, and the result or conclusion is provided by an algorithm.

关 键 词：数理谋略论 最优策略 最优结盟方案 

分 类 号：O225[理学—运筹学与控制论]