检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《经济数学》2013年第1期33-36,共4页Journal of Quantitative Economics
基 金:国家自然科学基金项目(11271367)
摘 要:结合DEA和博弈的思想研究二阶段网络系统的固定成本分摊问题,将分摊成本作为新的投入,可以证明存在某种分摊使DMU整体效率达到最优,在此基础上考虑各个DMU之间以及DMU内部之间的博弈,首先建立讨价还价乘积最大化模型,求出各DMU唯一的分摊解,然后建立DMU子系统之间的讨价还价模型,给出子系统的分摊解,最终的分摊方案满足系统效率和子系统效率为1,与现有的方法相比具有一定的优势.This paper combined DEA with the game theory to research the fixed cost allocation of two-stage network systems. It is proven that, if the allocated costs can be treated as an additional input,there are some cost allocation plans which satisfy that the efficiency of the overall DMUs is optimal. Then, we considered the game among the DMUs and the game between the two subsystems of each DMU. Firstly, a bargain multiplied maximize model was proposed. Secondly, we presented the bargain game model between the two subsystems and gave the sharing solution. Finally,the numerical example shows that the method is effective, which expands the application of DEA.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.167.222