Algorithmic Cost Allocation Games: Theory and Applications
This article gives an overview on some of the results of the author’s PhD thesis . This thesis deals with the cost allocation problem, which arises when several participants share the costs of building or using a common infrastructure.We attempt to answer the question: What is a fair cost allocation among participants? By combining cooperative game theory and state-of-the-art algorithms from linear and integer programming, our work not only defines fair cost allocations but also calculates them numerically for large real-world applications.
KeywordsGrand Coalition Cost Allocation Price Vector Cooperative Game Theory Rail Transport
Unable to display preview. Download preview PDF.
- 1.Bussieck, M. R.: Optimal Lines in Public Rail Transport. PhD Thesis, TU Braunschweig (1998)Google Scholar
- 5.Grötschel, M., Lov´asz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, 2. corr. ed., Springer (1993)Google Scholar
- 7.Hoang, N. D.: Algorithmic Cost Allocation Games: Theory and Applications. PhD Thesis, Berlin (2010)Google Scholar