Optimal online k-min search
In a k-min search problem, a player wants to buy k units of an asset with the objective of minimizing the total buying cost. At each time period t, a price qt is observed, and the player has to decide on the number of units to buy without any knowledge of future prices. We design an optimal online a...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2015
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/3f9eb8d0419d47439ca1701b96211a34 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|