The cost of selfishness for maximizing the minimum load on uniformly related machines
نویسندگان
چکیده
منابع مشابه
The cost of selfishness for maximizing the minimum load on uniformly related machines
Consider the following scheduling game. A set of jobs, each controlled by a selfish agent, are to be assigned to m uniformly related machines. The cost of a job is defined as the total load on the machine that its job is assigned to. A job is interested in minimizing its cost, while the social objective is maximizing the minimum load (cover) over the machines. This goal is different from the re...
متن کاملMaximizing the Minimum Load: The Cost of Selfishness
We consider a scheduling problem on m machines, where each job is controlled by a selfish agent. Each agent is only interested in minimizing its own cost, defined as the total load of the machine that its job is assigned to. We consider the objective of maximizing the minimum load (the value of the cover) over the machines. Unlike the regular makespan minimization problem, which was extensively...
متن کاملA Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines
Designing truthful mechanisms for scheduling on related machines is a very important problem in single-parameter mechanism design. We consider the covering objective, that is we are interested in maximizing the minimum completion time of a machine. This problem falls into the class of problems where the optimal allocation can be truthfully implemented. A major open issue for this class is wheth...
متن کامل“the effect of risk aversion on the demand for life insurance: the case of iranian life insurance market”
abstract: about 60% of total premium of insurance industry is pertained?to life policies in the world; while the life insurance total premium in iran is less than 6% of total premium in insurance industry in 2008 (sigma, no 3/2009). among the reasons that discourage the life insurance industry is the problem of adverse selection. adverse selection theory describes a situation where the inf...
15 صفحه اولMaximizing the Minimum Load for Selfish Agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the regular load balancing problem, this problem has not been considered in this context before. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2012
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-012-9555-y