Skip to main content

Algorithmic Cost Allocation Games: Theory and Applications

  • Conference paper
  • First Online:
Operations Research Proceedings 2011

Part of the book series: Operations Research Proceedings ((ORP))

  • 2697 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bussieck, M. R.: Optimal Lines in Public Rail Transport. PhD Thesis, TU Braunschweig (1998)

    Google Scholar 

  2. Dantzig, G. B.: On the Significance of Solving Linear Programming Problems with Some Integer Variables. Econometrica 28, 30–44 (1960)

    Article  Google Scholar 

  3. Faigle, U., Kern, W., Kuipers, J.: On the computation of the nucleolus of a cooperative game. Internat. J. Game Theory 30, 79–98 (2001)

    Article  Google Scholar 

  4. Faigle, U., Kern, W., Paulusma, D.: Note on the Computational Complexity of Least Core Concepts for min-cost Spanning Tree Games. Math. Methods of Operations Research 52, 23–38 (2000)

    Article  Google Scholar 

  5. Grötschel, M., Lov´asz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, 2. corr. ed., Springer (1993)

    Google Scholar 

  6. Hallefjord, A., Helming, R., Jørnsten, K.: Computing the Nucleolus when the Characteristic Function is Given Implicitly: A Constraint Generation Approach. International Journal of Game Theory 24, 357–372 (1995)

    Article  Google Scholar 

  7. Hoang, N. D.: Algorithmic Cost Allocation Games: Theory and Applications. PhD Thesis, Berlin (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nam-Dũng Hoàng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoàng, ND. (2012). Algorithmic Cost Allocation Games: Theory and Applications. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_95

Download citation

Publish with us

Policies and ethics