Abstract
We consider a sequential problem of selling K identical assets over the finite time horizon with a fixed number of offers per time period and no recall of past offers. The objective is to find an optimal sequential procedure which maximizes the total expected revenue. In this paper, we derive an effective number of stoppings for an optimal sequential procedure for the selling problem with independent observations.
Original language | English |
---|---|
Pages (from-to) | 332-336 |
Number of pages | 5 |
Journal | European Journal of Operational Research |
Volume | 225 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Mar 2013 |
Keywords
- dynamic programming
- sequential decision analysis
- optimal stopping
- multiple stopping rules
- selling problem