Learning in structured MDPs with convex cost functions : improved regret bounds for inventory management
Year of publication: |
2022
|
---|---|
Authors: | Agrawal, Shipra ; Jia, Randy |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 70.2022, 3, p. 1646-1664
|
Subject: | censored demand | inventory control problem | Market Analytics and Revenue Management | online convex optimization | regret bounds | reinforcement learning | Theorie | Theory | Revenue-Management | Revenue management | Lagerhaltungsmodell | Inventory model | Lagermanagement | Warehouse management | Kostenfunktion | Cost function | Bestandsmanagement | Inventory management | Nachfrage | Demand | Mathematische Optimierung | Mathematical programming |
-
Mardan, Ehsan, (2015)
-
The retail planning problem under demand uncertainty
Georgiadis, George, (2013)
-
Zamani Dadaneh, Dariush, (2023)
- More ...
-
Optimistic posterior sampling for reinforcement learning : worst-case regret bounds
Agrawal, Shipra, (2023)
-
A Unified Framework for Dynamic Pari-Mutuel Information Market Design
Agrawal, Shipra, (2009)
-
Equilibrium in prediction markets with buyers and sellers
Agrawal, Shipra, (2010)
- More ...