We study a dynamic pricing problem for a company that sells a single product to a group of customers over a finite time horizon. These customers are price sensitive and the price of today influences the group of customers of tomorrow. The objective is to set the prices over time so as to...

It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing...

In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: it sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior or it...

In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: it sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior or it...

It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing...

We study a dynamic pricing problem for a company that sells a single product to a group of customers over a finite time horizon. These customers are price sensitive and the price of today influences the group of customers of tomorrow. The objective is to set the prices over time so as to...