Cost allocation rules for elastic single-attribute situations

DOI10.1002/NAV.21749MaRDI QIDQ4632973zbMATH OpenOpenAlexFDO

Authors Frank Karsten, Marco Slikker, Peter Borm

Publication date 2 May 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://research.tilburguniversity.edu/en/publications/e6c6ce3e-6168-40b2-bf64-04ed197e7871

zbMATH Keywords

convexitycooperative gamesresource pooling

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Cooperative games (91A12) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Resource Pooling and Cost Allocation Among Independent Service Providers
• scientific article; zbMATH DE number 3936915
• Probabilistic resource pooling games
• Allocating the gains from resource pooling with the Shapley Value
• On the core of cooperative queueing games

Cited in

(4)

• A fair staff allocation rule for the capacity pooling of multiple call centers
• Cost sharing methods for capacity restricted cooperative purchasing situations
• Supply chain design and cost allocation in a collaborative three-echelon supply network: a literature review
• Superadditive market games

This page was built for publication: Cost allocation rules for elastic single-attribute situations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632973)