Delayed information and action in on-line algorithms

Information and Computation

Volumn 170, Issue 2, 2001, Pages 135-152

  Albers, Susanne ^a   Charikar, Moses ^b   Mitzenmacher, Michael ^c  

^a UNIVERSITY OF FREIBURG   (Germany)

^b Stanford University   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS;

ON-LINE ALGORITHMS;

COMPUTER SCIENCE;

EID: 0035526663     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3057     Document Type: Article

References (37)

1. Albers, S. (1999), Better bounds for online scheduling, SIAM J. Comput. 29, 459-473.
2. Albers, S., von Stengel, B., and Werchner, R. (1995), A combined BIT and TIMESTAMP algorithm for the list update problem, Inform. Process. Lett. 56, 135-139.
3. Alon, N., Kalai, G., Ricklin, M., and Stockmeyer, L. (1992), Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling, in "Proc. 33rd Ann. Symp. on the Foundations of Computer Science," pp. 334-343.
4. Altman, E., and Nain, P. (1992), Closed loop control with delayed information, in "Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, Newport, Rhode Island," pp. 193-204, Assoc. Comput. Mach., New York.
5. Altman, E., and Stidham, S. (1996). Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information, "Queueing Systems: Theory and Applications."
6. Awerbuch, B., Azar, Y., and Bartal, Y. (1996). On line generalized Steiner problem, in "Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms," pp. 68-74.
7. Awerbuch, B., Azar, Y., Fiat, A., and Leighton, T. (1996), Making commitments in the face of uncertainty: How to pick a winner almost every time, in "Proc. 28th Ann. ACM Symp. on Theory of Computing," pp. 519-530.
8. Awerbuch, B., Bartal, Y., and Fiat, A. (1993), Competitive distributed file allocation, in "Proc. 25 ACM Symp. on Theory of Computing," pp. 164-173.
9. Bartal, Y. (1997), personal communication.
10. Bartal, Y., Charikar, M., and Indyk, P. (1997), On page migration and other relaxed task systems, in "Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms."
11. Bartal, Y., Byers, J., and Raz, D. (1997), Global optimization using local information with applications to flow control, in "Proc. 38th Ann. Symp. on Foundations of Computer Science." pp. 303-312.
12. Bartal, Y., Fiat, A., and Rabani, Y. (1992), Competitive algorithms for distributed data management, in "Proc. 24th Ann. ACM Symp. on the Theory of Computing," pp. 39-49.
13. Bartal, Y., and Rosen, A. (1997), The distributed k-server problem - A competitive distributed translator for k-server algorithms, J. Algorithms 23, 241-264.
14. Ben-David, S., and Borodin, A. (1994), A new measure for the study of on-line algorithms, Algorithmica 11, 73-91.
15. Black, D. L., and Sleator, D. D. (1989), "Competitive Algorithms for Replication and Migration Problems," Technical Report CMU-CS-89-201. Department of Computer Science, Carnegie-Mellon University.
16. Borodin, A., Linial, N., and Saks, M. (1992), An Optimal on-line algorithm for metrical task systems, J. Assoc. Comput. Mach. 39, 745-763.
17. Chou, A., Cooperstock, J., El-Yaniv, R., Klugerman, M., and Leighton, T. (1995), The statistical adversary allows optimal money-making trading schemes, in "Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms," pp. 467-476.
18. Cover, T. M. (1991), Universal portfolios, Math. Financ. 1, 1-29.
19. Deng, X., and Papadimitriou, C. H. (1992), Competitive distributed decision-making, in "Proc. 12th IFIP Congress," pp. 350-356.
20. El-Yaniv, R., Fiat, A., Karp, R., and Turpin, G. (1992), Competitive analysis of financial games, in "Proc. 33rd Ann. Symp. on Foundations of Computer Science," pp. 327-333.
21. Graham, R. L. (1966), Bounds for certain multi-processing anomalies, Bell Systems Technol. J. 45, 1563-1581.
22. Halldórsson, M. M., and Szegedy, M. (1992), Lower bounds for on-line graph coloring, in "Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms," pp. 211-216.
23. Hull, J. C. (1993), "Options, Futures, and Other Derivative Securities," 2nd ed., Prentice-Hall, New York.
24. Irani, S. (1994), Coloring inductive graphs on-line. Algorithmica 11, 53-62
25. Irani, S., and Rabani, Y. (1993). On the value of information in coordination games, in "Proc. 34th Ann. Symp. on Foundations of Computer Science." pp. 12-21.
26. Karp, R., and Raghavan, P. From a personal communication cited in [34].
27. Koutsoupias, E., and Papadimitriou, C. H. (1994). Beyond competitive analysis, in "Proc. 35th Ann. Symp. on Foundations of Computer Science." pp. 394-400.
28. Kuri, J., and Kumar, A. (1995), Optimal control of arrivals to queues with delayed queue length information, IEEE Trans. Automat. Control 40, pp. 1444-1450.
29. Mitzenmacher, M. (1997), How useful is old information? in "Proc. 16th Ann. ACM Symp. on Principles of Distributed Computing." pp. 83-91.
30. Mirchandaney, R., Towsley, D., and Stankovic, J. A. (1989), Analysis effects of delays on load sharing. IEEE Trans. Comput. 38, 1513-1525.
31. Papadimitriou, C. H., and Yannakakis, M. (1991), On the Value of information in distributed decision making, in "Proc. 25th ACM Symp. on Principles of Distributed Computing," pp. 61-64.
32. Papadimitriou, C. H., and Yannakakis, M. (1993), Linear programming without the matrix, in "Proc. 25th ACM Symp. on Theory of Computing," pp. 121-129.
33. Raghavan, P. (1991), "A Statistical Adversary for On-line Algorithms," On-Line Algorithms DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 79-83.
34. Reingold, N., Westbrook, J., and Sleator, D. D. (1994), Randomized competitive algorithms for the list update problem, Algorithmica 11, 15-32.
35. Sleator, D. D., and Tarjan, R. E. (1985), Amortized efficiency of list update and paging rules, Commun. Assoc. Comput. Mach. 28, 202-208.
36. Towsley, D., and Mirchandaney, R. (1988), The effect of communication delays on the performance of load balancing policies in distributed systems, in "Proc. Second International MCPR Workshop," pp. 213-226.
37. Yao, A. C.-C. (1977), Probabilistic computations: Towards a unified measure of complexity, in "Proc. 17th Ann. Symp. on Foundations of Computer Science," pp. 222-227.