Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm.

Abstract

Suppose a decision maker has to purchase a commodity over time with varying prices and demands.In particular, the price per unit might depend on the amount purchased and this price function might vary from step to step.The decision maker has a buffer of bounded size for storing units of the commodity that can be used to satisfy demands at later points in time.We seek for an algorithm deciding at which time to buy which amount of the commodity so as to minimize the cost.This kind of problem arises in many technological and economical settings like, e.g., battery management in hybrid cars and economical caching policies for mobile devices.A simplified but illustrative example is a frugal car driver thinking about at which occasion to buy which amount of gasoline.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 51 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.