Showing 1 - 10 of 34
The property of an allocation rule to be implementable in dominant strategies by a unique payment scheme is called revenue equivalence. In this paper we give a characterization of revenue equivalence based on a graph theoretic interpretation of the incentive compatibility constraints. The...
Persistent link: https://www.econbiz.de/10005209894
The property of an allocation rule to be implementable in dominant strategies by a unique payment scheme is called revenue equivalence. In this paper we give a characterization of revenue equivalence based on a graph theoretic interpretation of the incentive compatibility constraints. The...
Persistent link: https://www.econbiz.de/10005219968
The paper introduces a model for online parallel machine scheduling, where any single machine is run on the basis of a locally optimal sequencing policy. Jobs choose the machine on which they want to be processed themselves, and in addition, any job owns a piece of private information, namely...
Persistent link: https://www.econbiz.de/10005304843
We study the design of optimal mechanisms in a setting where job-agents compete for being processed by a service provider that can handle one job at a time. Each job has a processing time and incurs a waiting cost. Jobs need to be compensated for waiting. We consider two models, one where only...
Persistent link: https://www.econbiz.de/10005209893
In this paper, we survey different models, techniques, and some recent results to tackle machine scheduling problems within a distributed setting. In traditional optimization, a central authority is asked to solve a (computationally hard) optimization problem. In contrast, in distributed...
Persistent link: https://www.econbiz.de/10005209907
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume a strategic setting, where the data of each job j, namely its release date r(j) , its processing time p(j) and its weight w(j) is only...
Persistent link: https://www.econbiz.de/10005209912
Persistent link: https://www.econbiz.de/10003647497
Persistent link: https://www.econbiz.de/10003808586
Persistent link: https://www.econbiz.de/10003866988
We consider a scheduling problem where a set of jobs is distributed over parallel machines. The processing time of any job is dependent on the usage of a scarce renewable resource, e.g., personnel. An amount of k units of that resource can be allocated to the jobs at any time, and the more of...
Persistent link: https://www.econbiz.de/10005304810