39 search results - page 1 / 8 » Envy-Free Makespan Approximation |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
SIAMCOMP
2012
12 years 1 months ago
2012
ALDT
2009
Springer
14 years 5 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
WWW
2011
ACM
13 years 6 months ago
2011
ACM
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
EUROPAR
2008
Springer
14 years 28 days ago
2008
Springer
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...