主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2016, Vol. 24 ›› Issue (7): 135-142.doi: 10.16381/j.cnki.issn1003-207x.2016.07.016

• 论文 • 上一篇    下一篇

基于最小平方距离的区间值合作对策求解模型与方法

李登峰1, 刘家财1,2   

  1. 1. 福州大学经济与管理学院, 福建 福州 350108;
    2. 福建农林大学交通与土木工程学院, 福建 福州 350002
  • 收稿日期:2014-12-24 修回日期:2015-10-20 出版日期:2016-07-20 发布日期:2016-07-27
  • 通讯作者: 李登峰(1965-),男(汉族),广西博白人,福州大学经济与管理学院教授,博导,研究方向:经济管理决策与对策(博弈),E-mail:lidengfeng@fzu.edu.cn E-mail:lidengfeng@fzu.edu.cn
  • 基金资助:

    国家自然科学基金重点项目(71231003);国家自然科学基金资助项目(71171055);高等学校博士学科点专项科研基金资助课题(20113514110009);福建省社会科学规划项目(2013C024);福建省教育厅科技项目(JA13122)

Models and Method of Interval-valued Cooperative Games Based on the Least Square Distance

LI Deng-feng1, LIU Jia-cai1,2   

  1. 1. School of Economics and Management, Fuzhou University, Fuzhou 350108, China;
    2. School of Traffic and Civil Engineering, Fujian Agriculture and Forestry University, Fuzhou 350002, China
  • Received:2014-12-24 Revised:2015-10-20 Online:2016-07-20 Published:2016-07-27

摘要: 现有针对联盟S特征(或支付)值表示为区间值υS)=[υLS),υRS)]的合作对策(简称区间值合作对策)的研究,多数利用区间算术(比如,区间减法)、特殊排序函数等,并在经典Shapley值基础上进行拓展。本文主要目的是发展一种基于最小平方法的n人区间值合作对策的有效求解方法。首先,利用区间值距离概念和最小平方法,建立以联盟分配与联盟支付值之差的平方和为最小的数学优化模型,据此求解确定每个局中人的区间值分配xi=[xLi, xRi](i=1,2,…,n),可由解析公式[XLXR]=[A-1 BLA-1 BR]的相应分量确定,其中BL=(υLS),υLS),…,υLS))TBR=(υLS),??υLS),…,υLS))TA-1=(1/2n-2)(a'ijn×n,且a'ij=-/(n+1)(i≠j时)或n/(n+1)(i=j时)。然后,推广所导出的辅助数学优化模型,使其满足诸如有效性xN)=υN)等要求,进而求解确定每个局中人的区间值分配x'i=[x'Li, x'Ri](i=1,2,…,n),可由解析公式[X'LX'R]=[X'L+(υLN)-xLie/nXR+(υRN)-xRie/n]的相应分量确定。最后,利用一个配送联盟问题的数值实例进行验证与比较分析,说明了所提出模型与方法的有效性、实用性和优越性。文中所提出的研究模型与方法可有效避免区间值减法运算带来的计算结果不确定性扩大等不合理问题,为求解区间值合作对策提供一种新的理论视角和实用工具。

关键词: 区间值合作对策, 最小平方法, 损失函数, 配送联盟, 数学规划

Abstract: Most of the existing studies on interval-valued cooperative games in which the values of coalitions S are expressed with intervals υ(S)=[υL(S),υR(S)]are based on the interval arithmetic (e.g., interval subtraction) and ranking functions of intervals and hereby are some extensions of the classic Shapley value. The main purpose of this paper is to develop an effective method for solving n-person interval-valued cooperative games based on the least square method. Firstly, according to the concept of the distance between intervals and the least square method, an optimization mathematical model is constructed through considering that players in coalitions try to guarantee their payoffs' sums being as close to the coalitions' values as possible. Through solving the constructed optimization mathematical model, all players' interval-valued payoffs xi=[xLi, xRi] (i=1,2,…,n) can be obtained, which can be determined by the analytical formula[XL,XR]=[A-1 BL,A-1 BR], where BL=(υL(S),υL(S),…,υL(S))T,BR=(υL(S),υL(S),…,υL(S))T,A-1=(1/2n-2)(a'ij)n×n, and a'ij=-/(n+1)(i≠j or n/(n+1) if i=j. Then, the auxiliary optimization mathematical model is extended so that it satisfies some conditions x(N)=υ(N) and hereby all players' interval-valued payoffs x'i=[x'Li, x'Ri] (i=1,2,…,n) are solved, which can be determined by the analytical formula[X'L,X'R]=[X'L+(υL(N)-xLi)e/n,XR+(υR(N)-xRi)e/n]. Finally, a numerical example of the dispatch coalition problem is used to conduct the validation and comparison analysis, which has shown that the proposed models and method are of the validity, the applicability, and the superiority. The models and method proposed in this paper can effectively avoid the magnification of uncertainty resulted from the subtraction of intervals and provide a new theoretical angle and suitable tool for solving interval-valued cooperative games.

Key words: interval-valued cooperative game, least square method, loss function, dispatch coalition, mathematical programming

中图分类号: