强Rasmusen智猪公理系统的最可能局势  

Most Probable Situations in Strong Rasmusen Axiom System for Boxed Pigs

作　　者：姜殿玉[1] 

机构地区：[1]淮海工学院对策论及其应用研究所,江苏连云港222005

出　　处：《系统工程》2012年第5期96-100,共5页Systems Engineering

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

摘　　要：基于Rasmusen原始智猪博弈模型,由引进大小猪的跑速、吃速、投食量和槽板距等指标和即喷公理、弱和平公理、强成本公理、强跑速公理和吃速公理,建立了所谓强Rasmusen智猪公理系统。给出最优局势分布公式,得到当成本和槽板距充分小时,最可能两猪都踏;当成本足够大时,最可能大猪独踏的结论。作为应用,引进一种所谓Rasmusen技术创新模型,举例说明了计算这种模型中各局势的概率和如何控制此概率的问题。By introducing running velocity, eating velocity, quantity of food into the trough（QFT） and distance between trough and panel （DTP） and so on and the axioms of instant appear, weak peace, strong cost, strong running velocity, and eating velocity, a so-called strong Rasmusen axiom system for games of boxed pigs is set, based on Rasmusen＇s primitive model. The formula of optimal situation distributin is given. The conclusions are proved that the two pigs pressing together is most probable when the cost and DTP are sufficiently small and that the big one pressing alone is also most probable when the cost is sufficiently great. A so-called Rasmusen technology innovation game model is introduced as an application of this theory. An example shows how analyti~ the situations in Rasmusen technology innovation model and control the situation.

关 键 词：强Rasmusen智猪公理系统 投食量 槽板距 最可能局势 Rasmusen技术创新博弈模型 

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