支付值为语言信息的矩阵对策求解方法  

Method for solving matrix games with payoffs of linguistic information

作　　者：杨靛青[1] 李登峰[1] 

机构地区：[1]福州大学经济与管理学院,福建福州350116

出　　处：《福州大学学报（自然科学版）》2016年第3期301-305,共5页Journal of Fuzhou University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(71231003;71171055);福建省社会科学规划资助项目(2012C022;FJ2015C141;FJ2015B185);福建省中青年教师教育科研资助项目(JA13392S);福州大学社科科研扶持基金资助项目(15SKF13)

摘　　要：在阐述语言评估标度定义及其运算法则、比较规则的基础上,提出了支付值为语言信息的矩阵对策定义及其解的概念,并研究了如何将求解局中人的极大-极小与极小-极大策略问题转化为求解一对辅助线性规划问题.数值实例表明,所提方法是有效、实用的,所建立的支付值为语言信息的矩阵对策理论与方法既是对经典矩阵对策理论的发展,又可为解决其他带有模糊语言信息的对策问题提供新的途径.The definition of linguistic labels and their operational laws as well as comparison laws are introduced. The definition of matrix games with payoffs of linguistic information and the concept of their solutions are given. The max- min and min- max strategies of two players are calculated by solving a pair of auxiliary linear programming models. A numerical example shows that the proposed method is effective and practical. The theory and method of matrix games with payoffs of linguistic information are not only an extension of those of classical matrix games,but also provide a new route for solving other matrix games with fuzzy linguistic information.

关 键 词：语言信息 矩阵对策 线性规划 对策论 

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