Common revenue allocation in DMUs with two stages based on DEA cross-efficiency and cooperative game

Xinyu Wang, Qianwei Zhang, Yilun Lu, Yingdi Zhao
{"title":"Common revenue allocation in DMUs with two stages based on DEA cross-efficiency and cooperative game","authors":"Xinyu Wang, Qianwei Zhang, Yilun Lu, Yingdi Zhao","doi":"arxiv-2409.08502","DOIUrl":null,"url":null,"abstract":"In this paper, we examine two-stage production organizations as\ndecision-making units (DMUs) that can collaborate to form alliances. We present\na novel approach to transform a grand coalition of n DMUs with a two-stage\nstructure into 2n single-stage sub-DMUs by extending the vectors of the initial\ninput, intermediate product, and final output, thus creating a 2n*2n DEA\ncross-efficiency (CREE) matrix. By combining cooperative game theory with CREE\nand utilizing three cooperative game solution concepts, namely, the nucleolus,\nthe least core and the Shapley value, a characteristic function is developed to\naccount for two types of allocation, i.e., direct allocation and secondary\nallocation. Moreover, the super-additivity and the core non-emptiness\nproperties are explored. It is found that the sum of the revenue allocated to\nall DMUs will remain constant at each stage regardless of the allocation manner\nand the cooperative solution concept selected. To illustrate the efficiency and\npracticality of the proposed approach, both a numerical example and an\nempirical application are provided.","PeriodicalId":501316,"journal":{"name":"arXiv - CS - Computer Science and Game Theory","volume":"16 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computer Science and Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we examine two-stage production organizations as decision-making units (DMUs) that can collaborate to form alliances. We present a novel approach to transform a grand coalition of n DMUs with a two-stage structure into 2n single-stage sub-DMUs by extending the vectors of the initial input, intermediate product, and final output, thus creating a 2n*2n DEA cross-efficiency (CREE) matrix. By combining cooperative game theory with CREE and utilizing three cooperative game solution concepts, namely, the nucleolus, the least core and the Shapley value, a characteristic function is developed to account for two types of allocation, i.e., direct allocation and secondary allocation. Moreover, the super-additivity and the core non-emptiness properties are explored. It is found that the sum of the revenue allocated to all DMUs will remain constant at each stage regardless of the allocation manner and the cooperative solution concept selected. To illustrate the efficiency and practicality of the proposed approach, both a numerical example and an empirical application are provided.
基于 DEA 交叉效率和合作博弈的两阶段 DMU 共同收入分配
在本文中,我们将两阶段生产组织视为可以合作结成联盟的决策单元(DMU)。我们提出了一种新方法,通过扩展初始投入、中间产品和最终产出的向量,将一个由 n 个具有两阶段结构的 DMU 组成的大联盟转化为 2n 个单一阶段的子 DMU,从而创建一个 2n*2n 的 DEA 交叉效率(CREE)矩阵。通过将合作博弈理论与 CREE 相结合,并利用三个合作博弈解概念,即核、最小核心和沙普利值,建立了一个特征函数,以考虑两种分配方式,即直接分配和二次分配。此外,还探讨了超加性和核不emptiness 特性。研究发现,无论选择哪种分配方式和合作方案概念,分配给所有 DMU 的收入总和在每个阶段都将保持不变。为了说明所提方法的效率和实用性,提供了一个数值示例和一个经验应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信