15 search results - page 3 / 3 » Tighter Bounds for Facility Games |
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
COCO
1998
Springer
13 years 9 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
IJCAI
1993
13 years 6 months ago
1993
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
IOR
2007
13 years 5 months ago
2007
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience,...