Regret minimization for online buffering problems using the weighted majority algorithm

COLT 2010 - The 23rd Conference on Learning Theory

Volumn , Issue , 2010, Pages 132-143

  Geulen, Sascha ^a   Vöcking, Berthold ^a   Winkler, Melanie ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BATTERY MANAGEMENT; CACHING POLICY; DECISION MAKERS; EXTERNAL REGRETS; ON-LINE ALGORITHMS; PRICE FUNCTION; REGRET MINIMIZATION; WEIGHTED MAJORITY ALGORITHM;

COSTS; DECISION MAKING; MOBILE DEVICES;

ALGORITHMS;

EID: 80054819291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A. Blum. On-line algorithms in machine learning. In Online Algorithms: The State of the Art, Volume 1442 of Lecture Notes in Computer Science, chapter 14, pages 306-325. Springer, 1998.
2. A. Blum and Y. Mansour. Learning, regret minimization, and equilibria. In N. Nisan, T. Rough-garden, E. Tardos, and V. V. Vazirani, editors, Algorithmic Game Theory, chapter 4, pages 79-101. Cambridge University Press, New York, NY, USA, 2007.
3. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, New York, NY, USA, 1998.
4. N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K. Warmuth. How to use expert advice. In Proceedings of the 25th ACM Symposium on Theory of Computing (STOC), pages 382-391, 1993.
5. M. Ehsani, Y. Gao, and K. L. Butler. Application of Electrically Peaking Hybrid (ELPH) Propulsion System to a Full-Size Passenger Car with Simulated Design Verification. IEEE Transactions on Vehicular Technology, 48(6):1779-1787, 1999.
6. R. El-Yaniv, A. Fiat, R. M. Karp, and G. Turpin. Optimal search and one-way trading online algorithms. Algorithmica, 30(1):101-139, 2001.
7. M. Englert, H. Röglin, J. Spönemann, and B. Vöcking. Economical caching. In Proceedings of the 26th Symposium on Theoretical Aspects of Computer Science (STACS), pages 385-396, 2009.
8. M. Englert, B. Vöcking, and M. Winkler. Economical caching with stochastic prices. In Proceedings of the 5th Symposium on Stochastic Algorithms, Foundations and Applications (SAGA), pages 179-190, 2009.
9. A. Flaxman, A. T. Kalai, and H. B. McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 385-394, 2005.
10. D. P. Foster and R. Vohra. Regret in the on-line decision problem. Games and Economic Behavior, 29(1-2):7-35, 1999.
11. S. Göbbels. Smart Caching for Continuous Broadband Services in Intermittent Wireless Networks. PhD thesis, RWTH Aachen University, Chair of Communication Networks (ComNets), 2009.
12. J. Hannan. Approximation to bayes risk in repeated plays. Contributions to the Theory of Games, 3:97-139, 1957.
13. L. Johannesson, M. Asbogard, and B. Egardt. Assessing the potential of predictive control for hybrid vehicle powertrains using stochastic dynamic programming. IEEE Transactions on Intelligent Transportation Systems, 8(1):71-83, 2007.
14. A. Kalai and S. Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3):291-307, 2005.
15. C.-Y. Li and G.-P. Liu. Optimal fuzzy power control and management of fuel cell/battery hybrid vehicles. Journal of Power Sources, 192(2):525-533, 2009.
16. N. Littlestone and M. Warmuth. The weighted majority algorithm. In Proceedings of the 30th Symposium on Foundations of Computer Science (SFCS), pages 256-261, 1989.
17. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.
18. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th International Conference on Machine Learning (ICML), pages 928-936, 2003.