Title
Routing and scheduling with incomplete information
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.
Year
DOI
Venue
2007
10.1007/978-3-540-75142-7_1
DISC
Keywords
Field
DocType
game theoretic approach,incomplete information,incomplete information setting
Congestion game,Computer science,Scheduling (computing),Supply chain network,Game theoretic,Complete information,Distributed computing
Conference
Volume
ISSN
ISBN
4731
0302-9743
3-540-75141-6
Citations 
PageRank 
References 
0
0.34
4
Authors
2
Name
Order
Citations
PageRank
Burkhard Monien12199279.35
Karsten Tiemann21107.71