Stock repurchase with an adaptive reservation price: A study of the greedy policy

We consider the problem of stock repurchase over a finite time horizon. We assume that a firm has a reservation price for the stock, which is the highest price that the firm is willing to pay to repurchase its own stock. We characterize the optimal policy for the trader to maximize the total number of shares he can buy over a fixed time horizon. In particular, we study a greedy policy, which involves in each period buying a quantity that drives stock price to the reservation price. Key words: stock repurchase, dynamic programming, reservation price.

• Type: Journal
• Year: 2011
• Where: ORL
• Authors: Ye Lu, Asuman E. Ozdaglar, David Simchi-Levi
• Keywords: Operations Research, ORL 2011, Reservation Price, Stock, Time Horizon