Eric Angel
ABSTRACT
No abstract available.
- E. Angel, E. Bampis, and F. Pascual. Truthful algorithms for scheduling selfish tasks on parallel machines. Theoretical Computer Science, 369, 2006. Google Scholar
Digital Library
- V. Auletta, P. Penna, R. de Prisco, and P. Persiano. How to route and tax selfish unsplittable traffic. In Proc. SPAA'2004, pages 196--204, 2004. Google ScholarDigital Library
- G. Christodoulou, L. Gourvès, and F. Pascual. Scheduling selfish tasks: About the performance of truthful algorithms. Submitted.Google Scholar
- D. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines on-line. SIAM J. on Computing, 24(6):1313--1331, 1995. Google ScholarDigital Library
Index Terms
- On the truthfulness and the approximation for scheduling selfish tasks
Recommendations
On truthfulness and approximation for scheduling selfish tasks
We consider the problem of designing truthful mechanisms for scheduling n tasks on a set of m parallel related machines in order to minimize the makespan. In what follows, we consider that each task is owned by a selfish agent. This is a variant of ...
Allocating indivisible goods
The problem of allocating divisible goods has enjoyed a lot of attention in both mathematics (e.g. the cake-cutting problem) and economics (e.g. market equilibria). On the other hand, the natural requirement of indivisible goods has been somewhat ...
Scheduling selfish tasks: about the performance of truthful algorithms
COCOON'07: Proceedings of the 13th annual international conference on Computing and CombinatoricsThis paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their length. The protocol gets these informations from agents who control the ...
Comments