On-line sequential bin packing

Journal of Machine Learning Research

Volumn 11, Issue , 2010, Pages 89-109

  György, András ^a   Lugosi, Gábor ^b   Ottucsák, György ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b DEPARTMENT OF ECONOMICS AND BUSINESS   (Spain)

^c BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Bin packing; On line learning; Prediction with expert advice

Indexed keywords

BIN PACKING; BIN PACKING PROBLEM; DECISION MAKERS; FIXED THRESHOLD; FREE SPACE; ONLINE LEARNING; PREDICTION WITH EXPERT ADVICE;

BINS;

EID: 76749110811     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. J. Boyar, L. Epstein, L. M. Favrholdt, J. S. Kohrt, K. S. Larsen, M. M. Pedersen, and S.Wøhlk. The maximum resource bin packing problem. Theoretical Computer Science, 362:127-139, 2006.
2. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, to appear, Cambridge, 2006.
3. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. In Approximation Algorithms for NP-hard Problems, pages 46-93. PWS Publishing Co., Boston, MA, 1997.
4. E. Even-Dar, S. M. Kakade, and Y. Mansour. Experts in a markov decision process. In L. K. Saul, Y. Weiss, and L. Bottou, editors, Advances in Neural Information Processing Systems 17, pages 401-408, Cambridge, MA, 2005. MIT Press.
5. A. György, G. Lugosi, and Gy. Ottucsák. On-line sequential bin packing. In Proceedings of the 21st Annual Conference on Learning Theory, COLT 2008, pages 447-454, Helsinki, Finland, July 2008.
6. J. Hannan. Approximation to bayes risk in repeated plays. In M. Dresher, A. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, volume 3, pages 97-139. Princeton University Press, 1957.
7. Y. He and Gy. Dósa. Bin packing and covering problems with rejection. In Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON 2005, volume 3595 of Lecture Notes in Computer Science, pages 885-894, Kunming, China, August 2005. Springer Berlin/Heidelberg.
8. N. Merhav, E. Ordentlich, G. Seroussi, and M. J. Weinberger. On sequential strategies for loss functions with memory. IEEE Transactions on Information Theory, 48:1947-1958, 2002.
9. S. S. Seiden. On the online bin packing problem. Journal of the ACM, 49(5):640-671, 2002.
10. J. Y. Yu, S. Mannor, and N. Shimkin. Markov decision processes with arbitrary reward processes. Mathematics of Operations Research, 34:737-757, 2009