A fair staff allocation rule for the capacity pooling of multiple call centers
From MaRDI portal
Publication:2450697
Recommendations
Cites work
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 41329 (Why is no real title available?)
- scientific article; zbMATH DE number 41338 (Why is no real title available?)
- scientific article; zbMATH DE number 1064455 (Why is no real title available?)
- scientific article; zbMATH DE number 3257031 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- A characterization of the Shapley value in queueing problems
- A pessimistic approach to the queueing problem
- Allocation of cost savings in a three-level supply chain with demand information sharing: a cooperative-game approach
- Cooperation in service systems
- Dimensioning Large Call Centers
- Externalities, tangible externalities, and queue disciplines
- Interchange fee rate, merchant discount rate, and retail price in a credit card network: A game-theoretic analysis
- Monotonic solutions of cooperative games
- No-envy in queueing problems
- Staffing many-server queues with impatient customers: constraint satisfaction in call centers
- The Aumann-Shapley price mechanism for allocating congestion costs
- The Nucleolus of a Characteristic Function Game
Cited in
(3)
This page was built for publication: A fair staff allocation rule for the capacity pooling of multiple call centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450697)