摘要
基于Bayes_ball算法,来判定多Agents影响图中任意2个决策节点是否S-可达,给出了构造策略相关图的完整算法.最后给出了算法正确性的证明.
S-reachability between two decision nodes in MAIDs is determineal based on the Bayes-ball algovithm.A complete algorithm for constructing the strategic relevance graph of MAIDs is presented.Finally soundness of the algorithm is proved.
出处
《云南大学学报(自然科学版)》
CAS
CSCD
2004年第2期115-118,共4页
Journal of Yunnan University(Natural Sciences Edition)
基金
国家自然科学基金资助项目(60263006)
云南省自然科学基金资助项目(2002F0063M).