Regret Minimization and Job Scheduling

  • Authors:
  • Yishay Mansour

  • Affiliations:
  • Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel

  • Venue:
  • SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single decision maker, a near optimal behavior under fairly adversarial assumptions. I will discuss a recent extensions of the classical regret minimization model, which enable to handle many different settings related to job scheduling, and guarantee the near optimal online behavior.