Cooperation in queuing systems can improve service and lower costs. This study uses cooperative game theory to solve cost allocation issues in queueing systems with shared resources. The researchers introduce Shapley value and proportional cost allocation methods, then focus on core-based cost allocation in cooperative queuing games. The core-based allocation is easy to use and ensures fairness. Simulation results show that core-based allocation outperforms Shapley value and proportional cost allocations.