Online allocation and pricing : constant regret via Bellman inequalities
Year of publication: |
2021
|
---|---|
Authors: | Vera, Alberto ; Banerjee, Siddartha ; Gurvich, Itai |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 69.2021, 3, p. 821-840
|
Subject: | stochastic optimization | approximate dynamic programming | online resource allocation | dynamic pricing | online packing | network revenue management | Dynamische Optimierung | Dynamic programming | Revenue-Management | Revenue management | Preismanagement | Pricing strategy | Mathematische Optimierung | Mathematical programming | Allokation | Allocation | Theorie | Theory | Algorithmus | Algorithm | Electronic Commerce | E-commerce | Stochastischer Prozess | Stochastic process | Online-Handel | Online retailing | Social Web | Social web |
-
The Bayesian prophet : a low-regret framework for online decision making
Vera, Alberto, (2021)
-
An approximation algorithm for network revenue management under nonstationary arrivals
Ma, Yuhang, (2020)
-
Dynamic pricing with automated purchase-reservation algorithms
Sato, Kimitoshi, (2021)
- More ...
-
Computing constrained shortest-paths at scale
Vera, Alberto, (2022)
-
The Bayesian Prophet : A Low-Regret Framework for Online Decision Making
Vera, Alberto, (2020)
-
The Bayesian prophet : a low-regret framework for online decision making
Vera, Alberto, (2021)
- More ...