Routing and scheduling with incomplete information

Authors:
Burkhard Monien;Karsten Tiemann
Affiliations:
Faculty of Computer Science, Electrical Engineering, and Mathematics, University of Paderborn, Paderborn, Germany;Faculty of Computer Science, Electrical Engineering, and Mathematics, University of Paderborn, Paderborn, Germany
Venue:
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Year:
2007

Citing 3
Cited 0

Selfish routing with incomplete information

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Routing (un-) splittable flow in games with player-specific linear latency functions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Congestion games with player-specific constants

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.