大型并行服务系统的利润分配机制设计

MECHANISM DESIGN OF PROFIT ALLOCATION FOR A LARGE-SCALE PARALLEL QUEUEING SERVICE SYSTEM

大型服务系统及其运营管理是目前诸如管理科学与信息科学中最重大的科学问题之一,也是在工业界和商业界备受关注的热点课题.在大型服务系统中,设计一个合理的利润分配机制是实现各个单元协同运营并能有效提高系统效率与效益的重要前提.文章使用合作博弈理论对具有n个独立并行不同M/M/1排队的服务系统的利润分配机制进行了数学建模,提出了三个不同的利润分配机制:1)利用Shapley值分配服务系统的利润:2)通过基于联盟长度的改进Shapley值,给出了利润分配的一种新机制:3)利用加权Shapley值设计了利润分配的另一种新机制.值得注意:这三种分配机制侧重于大型服务系统的利润分配的不同方面,其最终的分配结果对系统的运行产生不同的影响.最后,通过数值算例对Shapley值及其利润分配机制进行了详细分析与说明.

Service systems and their operation management are one of the most important and attractive scientific issues in, such as, management sciences and infor- mation sciences, and they are also hot topics in industrial and business areas. It is of great importance to design a reasonable profit allocation mechanism in a large-scale service system when cooperation of various cells is used to improve system＇s effec- tiveness and efficiency. To that end, we use the cooperative game theory to assign the profit allocation earned by the service units which are each of the n independent parallel different M/M/1 queues. We design three allocation mechanisms by means of the ordinary Shapley value, the modified shapely value based on the coalition length, and the weighted Shapley value. Since the three mechanisms focus on the different aspects of profit allocation, we discuss impacts of the three mechanisms on the sys- tem＇s operations, and specifically, some numerical examples are given for analysis and interpretation in some practical issues.