Abstract
The adjusted marginal allocation method which was proposed by Claus and Kleitman to allocate costs in a network is modified. Using the modified method, we obtain that if the final allocation is in the imputation set, it must be in the core. All three and four users cases are studied.
Zusammenfassung
Die marginale Zuordnungsmethode von Claus und Kleitman zum Festlegen von Kosten in einem Netzwerk wird modifiziert. Mit dieser modifizierten Methode ergibt sich folgender Sachverhalt: Ist die endgültige Kostenzuteilung eine Imputation, so ist sie auch im Kern. Es werden alle Fälle mit 3 und 4 Benutzern analysiert.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bird CB (1976) On cost allocation for a spanning tree: a game theoretic approach. Networks 6:335–350
Bondy JA, Murty USR (1976) Graph theory with applications. Macmillian Press
Claus A, Kleitman DJ (1973) Cost allocation for a spanning tree. Networks 3:289–304
Lucas WF (1981) Application of cooperative games to equitable allocation. Proceedings of Symposia in Applied Mathematics, vol 24, pp 19–36
Owen G (1982) Game theory. Academic Press
Syslo MM, Deo N, Kowalik JS (1983) Discrete optimization algorithms with Pascal programs. Prentice-Hall Inc
Author information
Authors and Affiliations
Additional information
The authors are grateful to two anonymous referees for many helpful suggestions.
Rights and permissions
About this article
Cite this article
Chang, C., Liao, W.P. & Tsay, G.R. Fair allocation on a network. ZOR - Methods and Models of Operations Research 34, 29–41 (1990). https://doi.org/10.1007/BF01415948
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01415948