A polynomial rule for the problem of sharing delay costs in PERT networks

DOI10.1016/j.cor.2006.11.003zbMath1180.90031OpenAlexW2013105411WikidataQ57618686 ScholiaQ57618686MaRDI QIDQ2468492

Javier Castro, Daniel Gómez, Juan Tejada

Publication date: 23 January 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.11.003

zbMATH Keywords

weighted Shapley valueserial cost sharing

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

Allocating slacks in stochastic PERT network ⋮ Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ On the Shapley value of liability games ⋮ A VALUE FOR PERT PROBLEMS ⋮ Polynomial calculation of the Shapley value based on sampling ⋮ Multi-mode resource-constrained project scheduling problem with material ordering under bonus-penalty policies ⋮ Hart and Mas-Colell consistency in PERT problems

Cites Work

• Unnamed Item
• General aggregation of demand and cost sharing methods
• Airport problems and consistent allocation rules.
• On the serial cost sharing rule
• How to distribute costs associated with a delayed project
• Two approaches to the problem of sharing delay costs in joint projects
• Serial Cost Sharing

This page was built for publication: A polynomial rule for the problem of sharing delay costs in PERT networks