A polynomial rule for the problem of sharing delay costs in PERT networks
| dc.contributor.author | Castro Cantalejo, Javier | |
| dc.contributor.author | Gómez González, Daniel | |
| dc.contributor.author | Tejada Cazorla, Juan Antonio | |
| dc.date.accessioned | 2023-06-20T09:37:35Z | |
| dc.date.available | 2023-06-20T09:37:35Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | In this paper we define the weighted serial cost sharing rule for the cost allocation problem.We apply this new rule to the problem of sharing delay costs in a PERT network. This rule belongs to the Core and is the Weighted Shapley Value for a particular game. Furthermore, we present a characterization of this rule and a polynomial algorithm for its calculation. | |
| dc.description.department | Depto. de Estadística e Investigación Operativa | |
| dc.description.faculty | Fac. de Ciencias Matemáticas | |
| dc.description.refereed | TRUE | |
| dc.description.sponsorship | Government of Spain, Grant Plan Nacional de I+D+i | |
| dc.description.status | pub | |
| dc.eprint.id | https://eprints.ucm.es/id/eprint/16006 | |
| dc.identifier.doi | 10.1016/j.cor.2006.11.003 | |
| dc.identifier.issn | 0305-0548 | |
| dc.identifier.officialurl | http://www.sciencedirect.com/science/article/pii/S0305054806002954 | |
| dc.identifier.relatedurl | http://www.sciencedirect.com | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14352/50061 | |
| dc.issue.number | 7 | |
| dc.journal.title | Computers and Operations Research | |
| dc.language.iso | eng | |
| dc.page.final | 2387 | |
| dc.page.initial | 2376 | |
| dc.publisher | Pergamon-Elsevier Science Ltd | |
| dc.relation.projectID | MTM2005-09184-C02-01 | |
| dc.rights.accessRights | restricted access | |
| dc.subject.cdu | 519.8 | |
| dc.subject.keyword | PERT | |
| dc.subject.keyword | Serial cost sharing | |
| dc.subject.keyword | Delay cost | |
| dc.subject.keyword | Weighted Shapley Value | |
| dc.subject.ucm | Investigación operativa (Matemáticas) | |
| dc.subject.unesco | 1207 Investigación Operativa | |
| dc.title | A polynomial rule for the problem of sharing delay costs in PERT networks | |
| dc.type | journal article | |
| dc.volume.number | 35 | |
| dcterms.references | Bergantiños G, Sánchez E. How to distribute costs associated with a delayed project. Annals of Operations Research 2002;109:159–74. Brânzei R, Ferrari G, FragnelliV, Tijs S. Two approaches to the problem of sharing delay costs in joint projects. Annals of Operations Research 2002;109:359–74. Moulin H, Shenker S. Serial cost sharing. Econometrica 1992;60:1009–37. Shapley LS. A value for n-person games. In: Kuhn HW, Tucker AW, editors, Contributions to the theory of games II. Annals of mathematics studies, vol. 28. Princeton, NJ: Princeton University Press; 1957. p. 307–17. Tijs S, Koster M. General aggregation of demand and cost sharing methods. Annals of Operations Research 1998;84:137–64. Potters J, Sudhölter P. Airport problems and consistent allocation rules. Mathematical Social Sciences 1999;38:83–102. Moulin H. On additive methods to share joint costs. Japanese Economic Review 1995;46:303–32. Albizuri MJ, Santos JC, Zarzuelo JM. On the serial cost sharing rule. International Journal of Game Theory 2002;31:437–46. Estévez-Fernandez A, Born P, Hamers H. Project games. Center discussion paper series, Tilburg University; 2005. De Frutos MA. Coalitional manipulation in a bankruptcy problem. Review of Economic Design 1999;4:255–72. Castro J, Gómez D, Tejada J. The use of proportional rule applied to durations for slack distribution in a PERT network. Technical Report,2005. | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | e556dae6-6552-4157-b98a-904f3f7c9101 | |
| relation.isAuthorOfPublication | 4dcf8c54-8545-4232-8acf-c163330fd0fe | |
| relation.isAuthorOfPublication | 77359969-4313-4334-adef-1c2d7413fbb5 | |
| relation.isAuthorOfPublication.latestForDiscovery | e556dae6-6552-4157-b98a-904f3f7c9101 |
Download
Original bundle
1 - 1 of 1