Deterministic monotone algorithms for scheduling on related machines

Lecture Notes in Computer Science

Volumn 3351, Issue , 2005, Pages 267-280

  Ambrosio, Pasquale ^a   Auletta, Vincenzo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; PROCESSING; SCHEDULING;

APPROXIMATION RATIO; DETERMINISTIC MONOTONE ALGORITHMS; MONOTONICITY; PROCESSING TIME;

ALGORITHMS;

EID: 23944454453     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31833-0_22     Document Type: Conference Paper

References (19)

1. [AA04] P. Ambrosio and V. Auletta. Deterministic monotone algorithms for scheduling on related machines. Technical Report Università di Salerno, 2004.
2. [AT01] A. Archer and E. Tardos. Truthful mechanisms for one-parameter agents. In Proc. of FOCS, pages 482 - 491, 2001.
3. [AA+93] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Warts. On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling. In Journal of ACM, 44: 486 - 504.
4. [AD+04] V. Auletta, R. De Prisco, P. Penna and G. Persiano. The Power of Verification for One-Parameter Agents. In Proc. of ICALP '04, 2004.
5. [AP04] V. Auletta, R. De Prisco, P. Penna and G. Persiano. Deterministic Truthful Mechanisms for Scheduling on Selfish Machines. In Proc. of STACS '04, LNCS 2996, pages 608 - 619, 2004.
6. [BC97] P. Berman, M. Charikar and M. Karpinski. On-Line load Balancing for Related Machines. In Proc. of WADS '97, 1997.
7. [CS80] Y. Cho and S. Sahni. Bounds for list scheduling on uniform processors. SIAM Journal of Computing, vol.9 n.1, 1980.
8. [Cl71] E. H. Clarke. Multipart Pricing of Public Goods. Public Choice, pages 17 - 33, 1971.
9. [GI80] T. Gonzalez, O. Ibarra and S. Sahni. Bounds for LPT schedules on uniform processors. SIAM Journal of Computing, vol.6, 1977.
10. [Gr73] T. Groves. Incentive in Teams. Econometrica, 41: 617 - 631, 1973.
11. [Gr66] R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Tech. Journal, 45: 1563 - 1581, 1966.
12. [Gr69] R. L. Graham. Bound on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17:416-429, 1969.
13. [HS88] D. S. Hochbaum and D. B. Shmoys. A Polynomial Approximation Scheme for Scheduling on uniform processors: Using the Dual Approximation Approach. In SIAM Journal of Computing, vol. 17(3) pages 539 - 551, 1988.
14. [NR00] N. Nisan and A. Ronen. Computationally Feasible VCG Mechanisms. In Proceedings of the 2nd ACM Conference on Electronic Commerce (EC), pages 242 - 252, 2000.
15. [NR99] N. Nisan and A. Ronen. Algorithmic Mechanism Design. In Proc. of the 31st STOC, pages 129 - 140, 1999.
16. [OR94] M. J. Osborne and A. Rubinstein. A course in Game Theory. MIT Press, 1994.
17. [Pa01] C. H. Papadimitriou. Algorithms, Games and the Internet. In Proc. of the 33rd STOC, 2001.
18. [Ro00] A. Ronen. Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem, 2000.
19. [V61] W. Vickrey. Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8 - 37, 1961.