no code implementations • 30 Oct 2023 • Titing Cui, Su Jia, Thomas Lavastida
The dynamic pricing problem has been extensively studied under the \textbf{stream} model: A stream of customers arrives sequentially, each with an independently and identically distributed valuation.
1 code implementation • 22 Oct 2022 • Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
For each of these problems we introduce new algorithms that take advantage of multiple predictors, and prove bounds on the resulting performance.
no code implementations • NeurIPS 2021 • Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Second, once the duals are feasible, they may not be optimal, so we show that they can be used to quickly find an optimal solution.
no code implementations • 23 Nov 2020 • Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
Instance robustness ensures that the prediction is robust to modest changes in the problem input, where the measure of the change may be problem specific.