Skip to main content
SpringerLink
Log in

Routing and Scheduling with Incomplete Information

  • Conference paper
Distributed Computing (DISC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4731))

Included in the following conference series:

  • 599 Accesses

Abstract

In many large-scale distributed systems the users have only incomplete information about the system. We outline game theoretic approaches that are used to model such incomplete information settings.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Dong, J., Zhang, D., Nagurney, A.: A supply chain network equilibrium model with random demands. European Journal of Operational Research 156(1), 194–212 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. In: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 203–212. ACM Press, New York (2005) (also accepted to Theory of Computing Systems)

    Chapter  Google Scholar 

  3. Gairing, M., Monien, B., Tiemann, K.: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 501–512. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Harsanyi, J.C.: Games with Incomplete Information Played by Bayesian Players, I, II, III. Management Science 14, 159–182, 320–332, 468–502 (1967)

    Google Scholar 

  5. Mavronicolas, M., Milchtaich, I., Monien, B., Tiemann, K.: Congestion Games with Player-Specific Constants. In: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (to appear, 2007)

    Google Scholar 

  6. Milchtaich, I.: Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior 13(1), 111–124 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Electrical Engineering, and Mathematics, University of Paderborn, 33102 Paderborn, Germany

    Burkhard Monien & Karsten Tiemann

Authors
  1. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karsten Tiemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Pelc

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Tiemann, K. (2007). Routing and Scheduling with Incomplete Information. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75142-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75141-0

  • Online ISBN: 978-3-540-75142-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation