94 search results - page 7 / 19 » Non-clairvoyant Scheduling Games |
110
Voted
ATAL
2011
Springer
13 years 9 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
AAAI
2010
14 years 11 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
CHI
2006
ACM
15 years 10 months ago
2006
ACM
Drawing on an ethnographic study of hospital work in an operating room, we present the design and implementation of a web-based role-playing application of a master schedule. We s...
77
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...