Results 1  10
of
99
Algorithmic mechanism design
 Games and Economic Behavior
, 1999
"... We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agen ..."
Abstract

Cited by 660 (21 self)
 Add to MetaCart
We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents ’ interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice. Journal of Economic Literature
APPROXIMATION ALGORITHMS FOR SCHEDULING UNRELATED PARALLEL MACHINES
, 1990
"... We consider the following scheduling problem. There are m parallel machines and n independent.jobs. Each job is to be assigned to one of the machines. The processing of.job j on machine i requires time Pip The objective is to lind a schedule that minimizes the makespan. Our main result is a polynomi ..."
Abstract

Cited by 258 (6 self)
 Add to MetaCart
We consider the following scheduling problem. There are m parallel machines and n independent.jobs. Each job is to be assigned to one of the machines. The processing of.job j on machine i requires time Pip The objective is to lind a schedule that minimizes the makespan. Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints. In contrast to our main result, we prove that no polynomial algorithm can achieve a worstcase ratio less than ~ unless P = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
 IN PROCEEDINGS OF THE 40TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1999
"... We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel ..."
Abstract

Cited by 75 (17 self)
 Add to MetaCart
We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel machines and a constant number of unrelated machines with and without preemption allowed. Our schemes are efficient: for all variants the running time for a (1 + ffl) approximation is of the form f(1=ffl; m)poly(n).
Computing nash equilibria for scheduling on restricted parallel links
 In Proceedings of the 36th Annual ACM Symposium on the Thoery of Computing (STOC’04
, 2004
"... We consider the problem of routing n users on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the correspondingly restricted scheduling problem of assigning n jobs to m parallel ma ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
(Show Context)
We consider the problem of routing n users on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the correspondingly restricted scheduling problem of assigning n jobs to m parallel machines. In a Nash equilibrium, no user may improve its own Individual Cost (latency) by unilaterally switching to another link from its set of allowed links. For identical links, we present, as our main result, a polynomial time algorithm to compute from any given assignment a Nash equilibrium with nonincreased makespan. The algorithm gradually transforms the assignment by pushing the unsplittable user traffics through a flow network, which is constructed from the users and the links. The algorithm uses ideas from blocking flows. Furthermore, we use techniques simular to those in the generic PREFLOWPUSH algorithm to approximate in polynomial time a schedule with optimum makespan. This results to an improved approximation factor of 2 − 1w1 for identical links, where w1 is the largest user traffic, and to an approximation factor of 2 for related links. 2
Coordination mechanisms
 PROCEEDINGS OF THE 31ST INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING, IN: LECTURE NOTES IN COMPUTER SCIENCE
, 2004
"... We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination mechanism is measured by its price of anarchy—the worstcase performance of a Nash equilibrium over the (centrally controlled) soc ..."
Abstract

Cited by 55 (6 self)
 Add to MetaCart
(Show Context)
We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination mechanism is measured by its price of anarchy—the worstcase performance of a Nash equilibrium over the (centrally controlled) social optimum. We give upper and lower bounds for the price of anarchy for selfish task allocation and congestion games.
A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints
, 1994
"... Parallel programs may be represented as a set of interrelated sequential tasks. When multiprocessors are used to execute such programs, the parallel portion of the application can be speeded up by an appropriate allocation of processors to the tasks of the application. Given a parallel application d ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
Parallel programs may be represented as a set of interrelated sequential tasks. When multiprocessors are used to execute such programs, the parallel portion of the application can be speeded up by an appropriate allocation of processors to the tasks of the application. Given a parallel application defined by a task precedence graph, the goal of task scheduling (or processor assignment) is thus the minimization of the makespan of the application. In a heterogeneous multiprocessor system, task scheduling consists in determining which tasks will be assigned to each processor, as well as the execution order of the tasks assigned to each processor. In this work, we apply the tabu search metaheuristic to the solution of the task scheduling problem on a heterogeneous multiprocessor environment under precedence constraints. The topology of the Mean Value Analysis solution package for product form queueing networks is used as the framework for performance evaluation. We show that tabu search ob...
Polynomial time approximation algorithms for machine scheduling: Ten open problems
 Journal of Scheduling
, 1999
"... We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NPhard deterministic machine scheduling
problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature.
..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NPhard deterministic machine scheduling
problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature.
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
, 2005
"... We consider the problem of scheduling jobs on related machines owned by selfish agents. Previously, Archer and Tardos showed a 2approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). We provide a 5approximation deterministic truthful mechanism, ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
(Show Context)
We consider the problem of scheduling jobs on related machines owned by selfish agents. Previously, Archer and Tardos showed a 2approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). We provide a 5approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. In case the number of machines is constant, we provide a deterministic Fully Polynomial Time Approximation Scheme (FPTAS) algorithm, and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al, who showed a (4 + ε)approximation truthful mechanism.
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
 In ACM symposium on Theory of computing
, 1999
"... We consider the problem of scheduling n independent jobs on m unrelated parallel machines, where each job has to be processed by exactly one machine, processing job j on machine i requires p ij time units, and the objective is to minimize the makespan, i.e. the maximum job completion time. Focusing ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
(Show Context)
We consider the problem of scheduling n independent jobs on m unrelated parallel machines, where each job has to be processed by exactly one machine, processing job j on machine i requires p ij time units, and the objective is to minimize the makespan, i.e. the maximum job completion time. Focusing on the case when m is xed, we present for both preemptive and nonpreemptive variants of the problem fully polynomial approximation schemes whose running times depend only linearly on n. We also study an extension of the problem, where processing job j on machine i incurs a cost of c ij , and thus there are two optimization criteria: makespan and cost. We show that for any xed m, there is a fully polynomial approximation scheme that, given values T and C, computes for any xed > 0 a schedule in O(n) time with makespan at most (1 + )T and cost at most (1 + )C, if there exists a schedule of makespan T and cost C. 1 Introduction Let n and m denote the number of jobs and machines, respect...