On the core of cooperative queueing games

DOI10.1016/J.ORL.2011.06.016zbMath1235.91018OpenAlexW2130218910MaRDI QIDQ408409

Qiong Wang, Martin I. Reiman, Ulaş Özen

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.016

zbMATH Keywords

cooperative gamescorequeueing modelspopulation monotonic allocation schemes

Mathematics Subject Classification ID

Cooperative games (91A12) Applications of game theory (91A80) Queues and service in operations research (90B22)

Related Items (9)

Pooling of spare parts between multiple users: how to share the benefits? ⋮ Resource Pooling and Cost Allocation Among Independent Service Providers ⋮ Cooperation and sharing costs in a tandem queueing network ⋮ DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ On the existence of population-monotonic solutions on the domain of quasi-convex games ⋮ Queueing games with an endogenous number of machines ⋮ Customer and Cost Sharing in a Jackson Network ⋮ Resource location games

Cites Work

• Unnamed Item
• Optimal sharing of surgical costs in the presence of queues.
• Population monotonic allocation schemes for cooperative games with transferable utility
• Cooperation in Markovian queueing models
• Cooperation in Service Systems
• Resource Sharing for Efficiency in Traffic Systems

This page was built for publication: On the core of cooperative queueing games