| License: Creative Commons Attribution 4.0 PDF - Published Version (1MB) |
- URN to cite this document:
- urn:nbn:de:bvb:355-epub-512737
- DOI to cite this document:
- 10.5283/epub.51273
This publication is part of the DEAL contract with Springer.
Abstract
We develop a modified exploration–exploitation algorithm which allocates a fixed resource (e.g., a fixed budget) to several units with the objective to attain maximum sales. This algorithm does not require knowledge of the form and the parameters of sales response functions and is able to cope with additive random disturbances. Note that additive random disturbances, as a rule, are a component of ...

Owner only: item control page

Download Statistics