The DEA Nash bargaining model for allocating the fixed cost considering benefit

ZHANG Qi-ping, LIU Ye-zheng, LI Yong-jun

Systems Engineering - Theory & Practice ›› 2014, Vol. 34 ›› Issue (3) : 756-768.

PDF(827 KB)
PDF(827 KB)
Systems Engineering - Theory & Practice ›› 2014, Vol. 34 ›› Issue (3) : 756-768. DOI: 10.12011/1000-6788(2014)3-756

The DEA Nash bargaining model for allocating the fixed cost considering benefit

  • ZHANG Qi-ping1,2, LIU Ye-zheng1,2, LI Yong-jun3
Author information +
History +

Abstract

This paper has studied the problem of allocating the fixed cost among decision making units. Suppose the production processes of decision making units during the two continuous periods which are before and after the fixed cost input are available, and the modeling premise is that combining the allocated cost with other input elements averagely. Firstly, the decision making units' super CCR efficiency evaluation model considering allocated cost is given. Then the input-output variation and allocated fixed cost oriented decision making units' relative benefit recognition model is built. Based on the Nash bargaining cooperative game theory, the cost allocation model considering relative efficiency and benefit is proposed. The approach is illustrated by a numerical example, which figures that the approach is available and acceptable.

Key words

DEA (data envelopment analysis) / super efficiency / benefit / Nash bargaining / cost allocation

Cite this article

Download Citations
ZHANG Qi-ping , LIU Ye-zheng , LI Yong-jun. The DEA Nash bargaining model for allocating the fixed cost considering benefit. Systems Engineering - Theory & Practice, 2014, 34(3): 756-768 https://doi.org/10.12011/1000-6788(2014)3-756

References

[1] Moghaddam A T N, Christian M. A contribution to the linear programming approach to joint cost allocation: Methodology and application[J]. European Journal of Operational Research, 2009, 197(3): 999-1011.
[2] Butler M, Williams H P. The allocation of shared fixed costs[J]. European Journal of Operational Research, 2006, 170(2): 391-397.
[3] Chen R R, Yin S Y. The equivalence of uniform and Shapley value-based cost allocations in a specific game[J]. Operations Research Letters, 2010, 38(6): 5391-5544.
[4] Kruś L, Bronisz P. Cooperative game solution concepts to a cost allocation problem[J]. European Journal of Operational Research, 2000, 122(2): 258-271.
[5] Erli G, Takahasi K, Chen L, et al. Transmission expansion cost allocation based on cooperative game theory for congestion relief[J]. International Journal of Electrical Power & Energy Systems, 2005, 27(1): 61-67.
[6] Ye F, Xu X J. Cost allocation model for optimizing supply chain inventory with controllable lead time[J]. Computers & Industrial Engineering, 2010, 59(1): 93-99.
[7] Angel E, Bampis E, Blin L, et al. Fair cost-sharing methods for the minimum spanning tree game[J]. Information Processing Letters, 2006, 100(1): 29-35.
[8] Trudeau C. A new stable and more responsive cost sharing solution for minimum cost spanning tree problems[J]. Games and Economic Behavior, 2012, 75(1): 402-412.
[9] Wong H, Oudheusden D V, Cattrysse D. Cost allocation in spare parts inventory pooling[J]. Transportation Research Part E: Logistics and Transportation Review, 2007, 43(4): 370-386.
[10] Charnes A, Cooper W W, Rhodes E. Measuring the efficiency of decision making units[J]. European Journal of Operational Research, 1978(6): 429-444.
[11] Cook W D, Kress M. Characterizing an equitable allocation of shared costs: A DEA approach[J]. European Journal of Operational Research, 1999, 119(3): 652-661.
[12] Jahanshahloo G R, Lotfi F H, Shoja N, et al. An alternative approach for equitable allocation of shared costs by using DEA[J]. Applied Mathematics and Computation, 2004, 153(1): 267-274.
[13] Cook W D, Zhu J. Allocation of shared costs among decision making units: A DEA approach[J]. Computers & Operations Research, 2005, 32(8): 2171-2178.
[14] Lin R Y. Allocating fixed costs or resources and setting targets via data envelopment analysis[J]. Applied Mathematics and Computation, 2011, 217(13): 6349-6358.
[15] Amirteimoori A, Kordrostami S. Allocating fixed costs and target setting: A DEA-based approach[J]. Applied Mathematics and Computation, 2005, 171(1): 136-151.
[16] Beasley J E. Allocating fixed costs and resources via data envelopment analysis[J]. European Journal of Operational Research, 2003, 147(1): 198-216.
[17] 李勇军, 梁樑.基于DEA与联盟博弈的固定成本分摊方法[J].系统工程理论与实践, 2008, 28(11): 80-84.Li Yongjun, Liang Liang. Method of allocating the fixed cost based on data envelopment analysis and cooperative game[J]. Systems Engineering —Theory & Practice, 2008, 28(11): 80-84.
[18] 李勇军, 梁樑.一种基于DEA与Nash讨价还价博弈的固定成本分摊方法[J].系统工程, 2008, 26(6): 73-77.Li Yongjun, Liang Liang. A method of allocating the fixed cost based on data envelopment analysis and Nash bargain game[J]. Systems Engineering, 2008, 26(6): 73-77.
[19] 李勇军, 梁#
[37], 凌六一.基于DEA联盟博弈核仁解的固定成本分摊方法研究[J].中国管理科学, 2009, 17(1): 58-63.Li Yongjun, Liang Liang, Ling Liuyi. The methodological study of allocating the fixed cost based on the nucleolus in data envelopment analysis and cooperative game[J]. Chinese Journal of Management Science, 2009, 17(1): 58-63.
[20] 李勇军, 戴前智, 毕功兵, 等.基于DEA和核心解的固定成本分摊方法研究[J].系统工程学报, 2010, 25(5): 675-680.Li Yongjun, Dai Qianzhi, Bi Gongbing, et al. Allocating the fixed cost based on the core and data envelopment analysis[J]. Journal of Systems Engineering, 2010, 25(5): 675-680.
[21] Li Y J, Yang F, Liang L, et al. Allocating the fixed cost as a complement of other cost inputs: A DEA approach[J]. European Journal of Operational Research, 2009, 197(1): 389-401.
[22] Andersen P, Petersen N C. A procedure for ranking efficient units in data envelopment analysis[J]. Management Science, 1993, 39(10): 1261-1264.
[23] Nash J F. The bargaining problem[J]. Econometrica, 1950, 18(2): 155-162.
[24] Nash J F. Two-person cooperative games[J]. Econometrica, 1953, 21: 128-140.
PDF(827 KB)

360

Accesses

0

Citation

Detail

Sections
Recommended

/