DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES

DOI10.1017/S0269964814000102zbMath1371.60161OpenAlexW2045224835MaRDI QIDQ5349304

Frank Karsten, Marco Slikker, Geert-Jan van Houtum

Publication date: 24 August 2017

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964814000102

zbMATH Keywords

cooperative gamesscalabilityErlang loss function

Mathematics Subject Classification ID

Cooperative games (91A12) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (2)

Resource Pooling and Cost Allocation Among Independent Service Providers ⋮ Cooperation and sharing costs in a tandem queueing network

Cites Work

• Unnamed Item
• On the core of cooperative queueing games
• On the continued Erlang loss function
• Population monotonic allocation schemes for cooperative games with transferable utility
• Cooperation in Service Systems
• Inventory pooling games for expensive, low-demand spare parts
• Resource Pooling and Cost Allocation Among Independent Service Providers
• Convexity Properties of the Erlang Loss Formula
• Congestion in Blocking Systems-A Simple Approximation Technique
• Resource Sharing for Efficiency in Traffic Systems
• A linear programming model for design of communications networks with time varying probabilistic demands
• Optimal Workload Allocation in Open Networks of Multiserver Queues
• Some Properties of the Erlang Loss Function
• On the relationship between cost and service models for general inventory systems

This page was built for publication: DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES