Abstract
We follow the travails of Enzo the baker, Orsino the oven man, and Beppe the planner. Their situation have a common theme: They know the input, in the form of a sequence of items, and they are not computationally constrained. Their issue is that they don’t know in advance the time of reckoning, i.e. when their boss might show up, when they will be measured in terms of their progress on the prefix of the input sequence seen so far. Their goal is therefore to find a particular solution whose size on any prefix of the known input sequence is within best possible performance guarantees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albers, S.: Better bounds for online scheduling. In: STOC, pp. 130–139 (1997)
Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC (2005)
Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. J. Algorithms 52, 120–133 (2004)
Bartal, Y., Karloff, H.J., Rabani, Y.: A better lower bound for on-line scheduling. Inf. Process. Lett 50(3), 113–116 (1994)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)
Dani, V., Hayes, T.P.: Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary. In: SODA (2006)
Epstein, L., Levin, A.: On the Max Coloring Problem. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 142–155. Springer, Heidelberg (2008)
Faigle, U., Kern, W., Turán, G.: On the performance of on-line algorithms for partition problems. Acta Cybernetica 9, 107–119 (1989)
Fukunaga, T., Halldórsson, M.M., Nagamochi, H.: Robust cost colorings. In: SODA (2008)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Approximating non-preemptive open-shop scheduling and related problems. ACM Transactions on Algorithms 2(1), 116–129 (2006)
Goel, A., Meyerson, A.: Simultaneous optimization via approximate majorization for concave profits or convex costs. Algorithmica 44, 301–323 (2006)
Hassin, R., Rubinstein, S.: Robust matchings. SIAM J. Disc. Math. 15(4), 530–537 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M., Shachnai, H. (2010). Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)