Algorithmic Cost Allocation Games: Theory and Applications

Nam-Dũng Hoàng ()
Additional contact information
Nam-Dũng Hoàng: Vietnam National University

A chapter in Operations Research Proceedings 2011, 2012, pp 599-604 from Springer

Abstract: Abstract This article gives an overview on some of the results of the author’s PhD thesis [7]. 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.

Keywords: Grand Coalition; Cost Allocation; Price Vector; Cooperative Game Theory; Rail Transport (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_95

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_95

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().