2013Systems EngineeringRequires access

Cost Allocation for Cooperation in Queuing System with Application of Cooperative Game Theory

Zeng Yin-lia

Open publisher page 1 citations

Abstract

Cooperation is an important way for queuing systems to enhance service level and reduce service cost. This paper studies the cost allocation problem for cooperation in queueing system with resource pooling. Cooperative game theory is applied to deal with the cost allocation problem arising from cooperation in queuing system. First, Shapley value and proportional cost allocation are introduced to allocate the total cost. Then, this paper focuses on the cost allocation based on the core of the corresponding cooperative queuing game. This allocation is easy to implement and is in the core. Finally, the simulation confirms that the cost allocation based on the core has advantage over Shapley value and proportional cost allocations.

About this research paper

What this paper is about

Cooperation is an important way for queuing systems to enhance service level and reduce service cost. This paper studies the cost allocation problem for cooperation in queueing system with resource pooling. Cooperative game theory is applied to deal with the cost allocation problem arising from cooperation in queuing system. First, Shapley value and proportional cost allocation are introduced to allocate the total cost. Then, this paper focuses on the cost allocation based on the core of the corresponding cooperative queuing game. This allocation is easy to implement and is in the core. Finally, the simulation confirms that the cost allocation based on the core has advantage over Shapley value and proportional cost allocations.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Cooperation is an important way for queuing systems to enhance service level and reduce service cost. This paper studies the cost allocation problem for cooperation in queueing system with resource pooling. Cooperative game theory is applied to deal with the cost allocation problem arising from cooperation in queuing system. First, Shapley value and proportional cost allocation are introduced to allocate the total cost. Then, this paper focuses on the cost allocation based on the core of the corresponding cooperative queuing game. This allocation is easy to implement and is in the core. Finally, the simulation confirms that the cost allocation based on the core has advantage over Shapley value and proportional cost allocations.

Key concepts: Shapley value, Cost allocation, Cooperative game theory, Queueing theory, Resource allocation, Pooling, Game theory, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Cost Allocation for Cooperation in Queuing System with Application of Cooperative Game Theory — Research Paper | ScholarLens